Adiabatic graph-state quantum computation
From MaRDI portal
Publication:3387146
DOI10.1088/1367-2630/16/11/113070zbMath1451.81160arXiv1309.1443OpenAlexW2090829767MaRDI QIDQ3387146
No author found.
Publication date: 12 January 2021
Published in: New Journal of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1443
Related Items (4)
Outcome determinism in measurement-based quantum computation with qudits ⋮ Symmetry-protected adiabatic quantum transistors ⋮ Green's function approach for quantum graphs: an overview ⋮ Generalized cluster states based on finite groups
Cites Work
- Unnamed Item
- Unnamed Item
- Holonomic quantum computation
- Geometric Phase in Open Systems
- Berry phase effects on electronic properties
- Computational Depth Complexity of Measurement-Based Quantum Computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Parity, circuits, and the polynomial-time hierarchy
- Finding Optimal Flows Efficiently
- The quantum adiabatic optimization algorithm and local minima
- Quantal phase factors accompanying adiabatic changes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Universal Blind Quantum Computation
- Adiabatic Quantum State Generation
This page was built for publication: Adiabatic graph-state quantum computation
