Adiabatic graph-state quantum computation

DOI10.1088/1367-2630/16/11/113070MaRDI QIDQ3387146zbMATH OpenOpenAlexFDO

Authors

Publication date 12 January 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1309.1443

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

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 $dotH$ as well as the degree of $H$, 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.

Recommendations

• Entanglement, flow and classical simulatability in measurement based quantum computation
• Extended measurement calculus
• Ancilla-driven quantum computation with twisted graph states
• The Role of Classical Computation in Measurement-Based Quantum Computation
• Outcome determinism in measurement-based quantum computation with qudits

Cites work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Adiabatic Quantum State Generation
• Berry phase effects on electronic properties
• Computational Depth Complexity of Measurement-Based Quantum Computation
• Finding Optimal Flows Efficiently
• Geometric phase in open systems
• Holonomic quantum computation
• scientific article; zbMATH DE number 6131346 (Why is no real title available?)
• Parity, circuits, and the polynomial-time hierarchy
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantal phase factors accompanying adiabatic changes
• The complexity of quantum spin systems on a two-dimensional square lattice
• The quantum adiabatic optimization algorithm and local minima
• Universal Blind Quantum Computation

Cited in

(6)

• Twisted graph states for ancilla-driven universal quantum computation
• Generalized cluster states based on finite groups
• Ancilla-driven quantum computation with twisted graph states
• Symmetry-protected adiabatic quantum transistors
• Green's function approach for quantum graphs: an overview
• Outcome determinism in measurement-based quantum computation with qudits

This page was built for publication: Adiabatic graph-state quantum computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387146)