Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1204.6021 · Physical Review A

Bose-Hubbard model for universal quantum-walk-based computation

Michael S. Underwood, David L. Feder

Published May 22, 2012• 21 citations
arXivHTMLPDF

Abstract

We present a scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary $X$ and $Z$ rotations are constructed, as well as an entangling two-qubit cphase gate and a swap gate. Quantum information is encoded in the positions of the walkers on the graph, as in previous quantum walk-based proposals for universal quantum computation, though in contrast to prior schemes this proposal requires a number of vertices only linear in the number of encoded qubits. It allows single-qubit measurements to be performed in a straightforward manner with localized operators and can make use of existing quantum error-correcting codes either directly within the universal gate set provided or by extending the lattice to a third dimension. We present an intuitive example of a logical encoding to implement the seven-qubit Steane code. Finally, an implementation in terms of ultracold atoms in optical lattices is suggested.

DOI
10.1103/physreva.85.052314

Related papers

Two-level quantum walkers on directed graphs. I. Universal quantum computing

Ryo Asaka, Kazumitsu Sakai, Ryoko Yahagi

In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic or bosonic multiparticle continuous-time quantum walk with two internal states (e.g., the spin-up and -down states of an electron). A dual-rail encoding is adopted to convert information: A single qubit is represented by the presence of a single quantum walker in either of the two parallel paths. We develop a roundabout gate that moves a walker from one path to the next, either clockwise or counterclockwise, depending on its internal state. It can be realized by a single-particle scattering on a directed weighted graph with the edge weights 1 and $\ifmmode\pm\else\textpm\fi{}i$. The roundabout gate also allows the spatial information of the quantum walker to be temporarily encoded in its internal states. The universal gates are constructed by appropriately combining several roundabout gates, some unitary gates that act on the internal states, and two-particle scatterings on straight paths. No ancilla qubits are required in our model. The computation is done by just passing quantum walkers through properly designed paths. Namely, there is no need for any time-dependent control. A physical implementation of quantum random access memory compatible with the present model will be considered in the second paper [R. Asaka et al., following paper, Phys. Rev. A 107, 022416 (2023)].

arXiv:2112.08119•Physical Review A•Feb 13, 2023•6 citations

Quantum Logic with Interacting Bosons in 1D

Yoav Lahini, Gregory R. Steinbrecher, Adam D. Bookatz +1 more

We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a one-dimensional Bose-Hubbard model with only nearest-neighbor hopping and on-site interactions. We find high-fidelity deterministic logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. We discuss the applicability of this scheme in light of recent developments in controlling and monitoring cold-atoms in optical lattices, as well as an implementation with realistic nonlinear quantum photonic devices.

arXiv:1501.04349•Jan 18, 2015•8 citations

High-fidelity Quantum Logic Gates with Interacting Bosons on a 1D Lattice

Yoav Lahini, Gregory R. Steinbrecher, Adam D. Bookatz +1 more

We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a one-dimensional Bose-Hubbard model with only nearest-neighbor hopping and on-site interactions. We find high-fidelity deterministic logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. We discuss the applicability of this scheme in light of recent developments in controlling and monitoring cold-atoms in optical lattices, as well as an implementation with realistic nonlinear quantum photonic devices.

•Jan 18, 2015•2 citations

Quantum logic using correlated one-dimensional quantum walks

Yoav Lahini, Gregory R. Steinbrecher, Adam D. Bookatz +1 more

Abstract Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle’s quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.

npj Quantum Information•Jan 5, 2018•46 citations

Error-correcting one-way quantum computation with global entangling gates

Jaewoo Joo, David L. Feder

We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.

arXiv:0908.0768•Physical Review A•Sep 11, 2009•8 citations

Quantum Walk Schemes for Universal Quantum Computation

Michael S. Underwood

Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small `widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.

•Jan 1, 2013•0 citations
We present a scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary XXX and ZZZ rotations are constructed, as well as an entangling two-qubit cphase gate and a swap gate. Quantum information is encoded in the positions of the walkers on the graph, as in previous quantum walk-based proposals for universal quantum computation, though in contrast to prior schemes this proposal requires a number of vertices only linear in the number of encoded qubits. It allows single-qubit measurements to be performed in a straightforward manner with localized operators and can make use of existing quantum error-correcting codes either directly within the universal gate set provided or by extending the lattice to a third dimension. We present an intuitive example of a logical encoding to implement the seven-qubit Steane code. Finally, an implementation in terms of ultracold atoms in optical lattices is suggested.
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic or bosonic multiparticle continuous-time quantum walk with two internal states (e.g., the spin-up and -down states of an electron). A dual-rail encoding is adopted to convert information: A single qubit is represented by the presence of a single quantum walker in either of the two parallel paths. We develop a roundabout gate that moves a walker from one path to the next, either clockwise or counterclockwise, depending on its internal state. It can be realized by a single-particle scattering on a directed weighted graph with the edge weights 1 and $\ifmmode\pm\else\textpm\fi{}i$. The roundabout gate also allows the spatial information of the quantum walker to be temporarily encoded in its internal states. The universal gates are constructed by appropriately combining several roundabout gates, some unitary gates that act on the internal states, and two-particle scatterings on straight paths. No ancilla qubits are required in our model. The computation is done by just passing quantum walkers through properly designed paths. Namely, there is no need for any time-dependent control. A physical implementation of quantum random access memory compatible with the present model will be considered in the second paper [R. Asaka et al., following paper, Phys. Rev. A 107, 022416 (2023)].
We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a one-dimensional Bose-Hubbard model with only nearest-neighbor hopping and on-site interactions. We find high-fidelity deterministic logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. We discuss the applicability of this scheme in light of recent developments in controlling and monitoring cold-atoms in optical lattices, as well as an implementation with realistic nonlinear quantum photonic devices.
We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a one-dimensional Bose-Hubbard model with only nearest-neighbor hopping and on-site interactions. We find high-fidelity deterministic logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. We discuss the applicability of this scheme in light of recent developments in controlling and monitoring cold-atoms in optical lattices, as well as an implementation with realistic nonlinear quantum photonic devices.
Abstract Quantum Walks are unitary processes describing the evolution of an initially localized wavefunction on a lattice potential. The complexity of the dynamics increases significantly when several indistinguishable quantum walkers propagate on the same lattice simultaneously, as these develop non-trivial spatial correlations that depend on the particle’s quantum statistics, mutual interactions, initial positions, and the lattice potential. We show that even in the simplest case of a quantum walk on a one dimensional graph, these correlations can be shaped to yield a complete set of compact quantum logic operations. We provide detailed recipes for implementing quantum logic on one-dimensional quantum walks in two general cases. For non-interacting bosons—such as photons in waveguide lattices—we find high-fidelity probabilistic quantum gates that could be integrated into linear optics quantum computation schemes. For interacting quantum-walkers on a one-dimensional lattice—a situation that has recently been demonstrated using ultra-cold atoms—we find deterministic logic operations that are universal for quantum information processing. The suggested implementation requires minimal resources and a level of control that is within reach using recently demonstrated techniques. Further work is required to address error-correction.
We present an approach to one-way quantum computation (1WQC) that can compensate for single-qubit errors by encoding the logical information residing on physical qubits into five-qubit error-correcting code states. A logical two-qubit cluster state that is the fundamental resource for encoded quantum teleportation is then described by a graph state containing ten vertices with constant degree seven. Universal 1WQC that incorporates error correction requires only multiple copies of this logical two-qubit state and a logical four-qubit linear cluster state, which are prepared only just in advance of their use in order to minimize the accumulation of errors. We suggest how to implement this approach in systems characterized by qubits in regular two-dimensional lattices for which entangling gates are generically global operations, such as atoms in optical lattices, quantum dots, or superconducting qubits.
Random walks are a powerful tool for the efficient implementation of algorithms in classical computation. Their quantum-mechanical analogues, called quantum walks, hold similar promise. Quantum walks provide a model of quantum computation that has recently been shown to be equivalent in power to the standard circuit model. As in the classical case, quantum walks take place on graphs and can undergo discrete or continuous evolution, though quantum evolution is unitary and therefore deterministic until a measurement is made. This thesis considers the usefulness of continuous-time quantum walks to quantum computation from the perspectives of both their fundamental power under various formulations, and their applicability in practical experiments. In one extant scheme, logical gates are effected by scattering processes. The results of an exhaustive search for single-qubit operations in this model are presented. It is shown that the number of distinct operations increases exponentially with the number of vertices in the scattering graph. A catalogue of all graphs on up to nine vertices that implement single-qubit unitaries at a specific set of momenta is included in an appendix. I develop a novel scheme for universal quantum computation called the discontinuous quantum walk, in which a continuous-time quantum walker takes discrete steps of evolution via perfect quantum state transfer through small `widget' graphs. The discontinuous quantum-walk scheme requires an exponentially sized graph, as do prior discrete and continuous schemes. To eliminate the inefficient vertex resource requirement, a computation scheme based on multiple discontinuous walkers is presented. In this model, n interacting walkers inhabiting a graph with 2n vertices can implement an arbitrary quantum computation on an input of length n, an exponential savings over previous universal quantum walk schemes. This is the first quantum walk scheme that allows for the application of quantum error correction. The many-particle quantum walk can be viewed as a single quantum walk undergoing perfect state transfer on a larger weighted graph, obtained via equitable partitioning. I extend this formalism to non-simple graphs. Examples of the application of equitable partitioning to the analysis of quantum walks and many-particle quantum systems are discussed.