Adiabatic graph-state quantum computation
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...
Main Authors: | B Antonio, D Markham, J Anders |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2014-01-01
|
Series: | New Journal of Physics |
Subjects: | |
Online Access: | https://doi.org/10.1088/1367-2630/16/11/113070 |
Similar Items
-
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
by: Chen-Fu Chiang, et al.
Published: (2023-08-01) -
Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
by: Jonathan Schrock, et al.
Published: (2017-09-01) -
Dissipation in adiabatic quantum computers: lessons from an exactly solvable model
by: Maximilian Keck, et al.
Published: (2017-01-01) -
Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
by: Andreas Hartmann, et al.
Published: (2019-01-01) -
Adiabatic and Hamiltonian computing on a 2D lattice with simple two-qubit interactions
by: Seth Lloyd, et al.
Published: (2016-01-01)