Franklin L. Marquezino

Orcid: 0000-0001-9712-1930

Affiliations:
  • Federal University of Rio de Janeiro, Brazil


According to our database1, Franklin L. Marquezino authored at least 27 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Steane code analysis by randomized benchmarking.
RAIRO Oper. Res., March, 2023

2022
A quantum approach to the discretizable molecular distance geometry problem.
Quantum Inf. Process., 2022

Total tessellation cover: Bounds, hardness, and applications.
Discret. Appl. Math., 2022

2021
A computational complexity comparative study of graph tessellation problems.
Theor. Comput. Sci., 2021

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates.
J. Univers. Comput. Sci., 2021

2020
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci., 2020

On the equivalence between quantum and random walks on finite graphs.
Quantum Inf. Process., 2020

Total tessellation cover and quantum walk.
CoRR, 2020

2019
A Primer on Quantum Computing
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-19065-1, 2019

Fourier 1-norm and quantum speed-up.
Quantum Inf. Process., 2019

The Tessellation Cover Number of Good Tessellable Graphs.
CoRR, 2019

2018
Quantum Query as a state decomposition.
Theor. Comput. Sci., 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
The tessellation problem of quantum walks.
CoRR, 2017

2016
QEDS: Um Simulador Clássico para Distinção de Elementos Quântico.
RITA, 2016

L<sub>1</sub>-norm and quantum speed-up.
CoRR, 2016

Quantum query without unitary operators.
CoRR, 2016

2015
Preserving privacy in a smart grid scenario using quantum mechanics.
Secur. Commun. Networks, 2015

A new reversible circuit synthesis algorithm based on cycle representations of permutations.
Electron. Notes Discret. Math., 2015

2012
Cayley graphs and analysis of quantum cost for reversible circuit synthesis
CoRR, 2012

2011
Quantum search algorithms on hierarchical networks.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
Analysis,Simulations and Algorithmic Applications of Quantum Walks.
PhD thesis, 2010

Spatial search on a honeycomb network.
Math. Struct. Comput. Sci., 2010

Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition.
J. Comput. Appl. Math., 2010

Mixing Times in Quantum Walks on Two-Dimensional Grids.
CoRR, 2010

2009
Decoherence in Search Algorithms.
CoRR, 2009

2008
The QWalk simulator of quantum walks.
Comput. Phys. Commun., 2008


  Loading...