Quantum-assisted quantum compiling
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow co...
Main Authors: | Sumeet Khatri, Ryan LaRose, Alexander Poremba, Lukasz Cincio, Andrew T. Sornborger, Patrick J. Coles |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2019-05-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2019-05-13-140/pdf/ |
Similar Items
-
Variational Quantum Fidelity Estimation
by: Marco Cerezo, et al.
Published: (2020-03-01) -
Learning the quantum algorithm for state overlap
by: Lukasz Cincio, et al.
Published: (2018-01-01) -
Noise resilience of variational quantum compiling
by: Kunal Sharma, et al.
Published: (2020-01-01) -
Variational Quantum Linear Solver
by: Carlos Bravo-Prieto, et al.
Published: (2023-11-01) -
Variational consistent histories as a hybrid algorithm for quantum foundations
by: Andrew Arrasmith, et al.
Published: (2019-07-01)