Compiling quantum algorithms for architectures with multi-qubit gates
arXiv:1601.06819 · doi:10.1088/1367-2630/18/6/063029
Abstract
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.
11 pages, 7 figures
References in corpus (4)
Cited by in corpus (47)
- Quantum chemistry calculations on a trapped-ion quantum simulator
- Scalable global entangling gates on arbitrary ion qubits
- Noisy intermediate-scale quantum computers
- Basic circuit compilation techniques for an ion-trap quantum machine
- Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
- Computer-inspired Quantum Experiments
- Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
- Theory of robust multi-qubit non-adiabatic gates for trapped-ions
- Transversality and lattice surgery: exploring realistic routes towards coupled logical qubits with trapped-ion quantum processors
- Measurement-free fault-tolerant quantum error correction in near-term devices
- LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
- Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
- Constructing quantum circuits with global gates
- Hidden Inverses: Coherent Error Cancellation at the Circuit Level
- Approximate Quantum Circuit Synthesis using Block-Encodings
- Quantum Circuits for Quantum Channels
- Quantum Circuit Compiler for a Shuttling-Based Trapped-Ion Quantum Computer
- Synthesis of and compilation with time-optimal multi-qubit gates
- QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
- Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions
- Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
- A Quantum von Neumann Architecture for Large-Scale Quantum Computing
- Generation of n-qubit W states using Spin Torque
- Heuristics for Quantum Compiling with a Continuous Gate Set
- Continuous quantum gate sets and pulse class meta-optimization
- Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning
- Quantum circuit synthesis via a random combinatorial search
- Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
- Signal processing techniques for efficient compilation of controlled rotations in trapped ions
- QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
- Robust and Resource-Efficient Quantum Circuit Approximation
- Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
- Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
- Compilation of Entangling Gates for High-Dimensional Quantum Systems
- Characterization, synthesis, and optimization of quantum circuits over multiple-control -rotation gates: A systematic study
- Interaction graph engineering in trapped-ion quantum simulators with global drives
- Synthesizing quantum circuits via numerical optimization
- Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
- Quantum algorithm for learning secret strings and its experimental demonstration
- Statistical evaluation and optimization of entanglement purification protocols
- Fault-tolerance in qudit circuit design
- Multi-Mode Global Driving of Trapped Ions for Quantum Circuit Synthesis
- Approximate 3-designs and partial decomposition of the Clifford group representation using transvections
- Improved Strategies for Fermionic Quantum Simulation with Global Interactions
- Optimal two-qubit gates in recurrence protocols of entanglement purification
- Quantum circuit synthesis with SQiSW
- Relaxation times do not capture logical qubit dynamics