Adiabatic graph-state quantum computation
arXiv:1309.1443 · doi:10.1088/1367-2630/16/11/113070
Abstract
Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any measurement-based quantum computation on a graph state with \emph{gflow} can be converted into an adiabatically driven holonomic computation, which we call \emph{adiabatic graph-state quantum computation} (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of as well as the degree of , in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated.
arXiv comment25 pages, 3 figures
References in corpus (25)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Berry Phase Effects on Electronic Properties
- Elementary gates for quantum computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Improved Simulation of Stabilizer Circuits
- Holonomic Quantum Computation
- Universal blind quantum computation
- Non-Abelian Berry connections for quantum computation
- Geometric phase in open systems
- Novel schemes for measurement-based quantum computation
- Computational power of correlations
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
- Perturbative Gadgets at Arbitrary Orders
- A simple nearest-neighbor two-body Hamiltonian system for which the ground state is a universal resource for quantum computation
- Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
- Unification and limitations of error suppression techniques for adiabatic quantum computing
- Noncyclic geometric changes of quantum states
- One-way Quantum Computation - a tutorial introduction
- Finding Optimal Flows Efficiently
- Adiabatic Cluster State Quantum Computing
- Theory of quantum computation
- Adiabatic Quantum Transistors
- Scheme for fault-tolerant holonomic computation on stabilizer codes
Cited by in corpus (5)
- Generalized Cluster States Based on Finite Groups
- Green's function approach for quantum graphs: an overview
- Symmetry-protected adiabatic quantum transistors
- Outcome determinism in measurement-based quantum computation with qudits
- Flow conditions for continuous variable measurement-based quantum computing