#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2004

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Franklin L. Marquezino, Renato Portugal
- Computer Physics Communications
- 2008

Several research groups are giving special attention to quantum walks recently, because this research area have been used with success in the development of new efficient quantum algorithms. A general simulator of quantum walks is very important for the development of this area, since it allows the researchers to focus on the mathematical and physical… (More)

- Franklin L. Marquezino, Renato Portugal, Gonzalo Abal
- ArXiv
- 2010

Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving… (More)

- Gonzalo Abal, Raul Donangelo, Franklin L. Marquezino, Renato Portugal
- Mathematical Structures in Computer Science
- 2010

The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the spatial search problem on a honeycomb lattice with N sites and torus-like boundary conditions. The search… (More)

The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally non-uniform) distribution π(x) in… (More)

- S. A. Grillo, Franklin L. Marquezino
- 2016

The Quantum Query Model is a framework that allow us to express most known quantum algorithms. Algorithms represented by this model consist on a set of unitary operators acting over a finite Hilbert space, and a final measurement step consisting on a set of projectors. In this work, we prove that the application of these unitary operators before the… (More)

Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover’s algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to… (More)

- Franklin L. Marquezino, Renato Portugal, Stefan Boettcher
- 2011 IEEE Information Theory Workshop
- 2011

The “abstract search algorithm” is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search… (More)

- A. C. Ribeiro, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Celina M. H. de Figueiredo
- Electronic Notes in Discrete Mathematics
- 2015

- Fábio Borges, Raqueline A. M. Santos, Franklin L. Marquezino
- Security and Communication Networks
- 2015