Quantum-assisted quantum compiling
Explore this paper's citation graph
Summary
This work proposes a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC), and presents both gradient-free and gradient-based approaches to minimizing the cost of this algorithm's cost.
- Type
- article
- Published
- 2018-07-02
- Cited by
- 416
- References
- 66
- Access
- Open access
- OpenAlex
- https://openalex.org/W2811032035
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:51821631
Keywords
Algorithm, Quantum computer, Computer science, Quantum algorithm, Function (biology)
References
- Optimization of the Solovay-Kitaev algorithm
- Quantum Compiler Optimizations
- swap test and Hong-Ou-Mandel effect are equivalent
- Understanding the difficulty of training deep feedforward neural networks
- A review of procedures to evolve quantum algorithms
- A Quantum Approximate Optimization Algorithm
- Optimization Techniques: IFIP Technical Conference, Novosibirsk, July 1-7, 1974
- Estimating Jones polynomials is a complete problem for one clean qubit
- Universal quantum circuit for N-qubit quantum gate: a programmable quantum gate
- Power of One Bit of Quantum Information
- Impossibility of Classically Simulating One-Clean-Qubit Model with Multiplicative Error.
- Optimal Quantum Circuits for General Two-Qubit Gates
- Asymptotically Optimal Topological Quantum Compiling
- A simple formula for the average gate fidelity of a quantum dynamical operation [rapid communication]
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulations
- Quantum Circuit Simplification and Level Compaction
- Adding control to arbitrary unknown quantum operations
- Constructing arbitrary Steane code single logical qubit fault-tolerant gates
- Quantum computations: algorithms and error correction
Cited by
- Learning the quantum algorithm for state overlap
- Universal discriminative quantum neural networks
- Variational quantum state diagonalization
- Quantum compilation and circuit optimisation via energy dissipation
- Quantum Chemistry in the Age of Quantum Computing.
- Variational consistent histories as a hybrid algorithm for quantum foundations
- Strong bound between trace distance and Hilbert-Schmidt distance for low-rank states
- The Born supremacy: quantum advantage and training of an Ising Born machine
- Variational quantum unsampling on a quantum photonic processor
- Short-depth circuits for efficient expectation-value estimation
- Stochastic Optimization of Quantum Programs
- Variational Quantum Fidelity Estimation
- Beyond the Swap Test: Optimal Estimation of Quantum State Overlap.
- Machine Learning Phase Transitions with a Quantum Processor
- Near-term Applications of Quantum Computers Based on Parametric Modulation of Superconducting Circuits
- Quantum compiling on locally adjusted circuits of designated architecture
- Noise resilience of variational quantum compiling
- Near-term quantum algorithms for linear systems of equations with regression loss functions
- Fault-tolerant quantum error correction on near-term quantum processors using flag and bridge qubits
- An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Related papers
- Simulation of Quantum Search Algorithm
- Variational Quantum Computation Integer Factorization Algorithm
- Quantum Computing Concepts with Deutsch Jozsa Algorithm
- Developing a Hardware Approach to Simulating Quantum Computing Using an Optimization Algorithm
- Genetic Algorithm Based Quantum Circuits Optimization for Quantum Computing Simulation
- SIMULATION AND EVALUATE THE PERFORMANCE OF GROVER’S ALGORITHM WITH RESPECT TO CLASSICAL ALGORITHM
- Grover algorithm circuit optimization and noise analysis on integer factorization
- Algorithms on ensemble quantum computers
- Simulating Grover's Quantum Search in a Classical Computer