Realizations of standard quantum computational circuits by adiabatic evolution
From MaRDI portal
Recommendations
- Realizable Hamiltonians for universal adiabatic quantum computers
- Improved gap estimates for simulating quantum circuits by adiabatic evolution
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Adiabatic quantum optimization with qudits
- Hypercomputation with quantum adiabatic processes
- ON THE ADIABATIC QUANTUM EVOLUTION OF A SINGLE QUBIT
- A multi-qubit system for a scalable adiabatic quantum evolution
- On the gap of Hamiltonians for the adiabatic simulation of quantum circuits
Cited in
(6)- Improved gap estimates for simulating quantum circuits by adiabatic evolution
- Realizable Hamiltonians for universal adiabatic quantum computers
- Automatically Translating Quantum Programs from a Subset of Common Gates to an Adiabatic Representation
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES
- On the circuit model of global adiabatic search algorithm
- A multi-qubit system for a scalable adiabatic quantum evolution
This page was built for publication: Realizations of standard quantum computational circuits by adiabatic evolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371536)