arXiv (Cornell University) · 2018 · 29 citations · 22 references
Open access
ComputingComputer EngineeringComputer ScienceAlgorithmsQuantum ComputingQuantum MechanicsQuantum AlgorithmsQuantum CircuitsQuantum CompilationQuantum ComputationQuantum GatesQuantum SimulationImaginary Time FormalismParameterized GatesQuantum Circuit CompilationQuantum Circuit ModelQuantum Circuit OptimizationQuantum Circuit SynthesisQubit CompilationTwo-qubit Gates
We describe a method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input i.e. A|in> = B|in>. This is of particular relevance to hybrid, NISQ-era algorithms for dynamical simulation or eigensolving. The user initially specifies B as a blank template: a layout of parameterised unitary gates configured to the identity. The compilation then proceeds using quantum hardware to perform an isomorphic energy-minimisation task, and optionally a gate elimination phase to compress the circuit. We use a recently introduced imaginary-time technique derived from McLachlan's variational principle. If the template for B is too shallow for perfect recompilation then the method will result in an approximate solution. As a demonstration we successfully recompile a 7-qubit circuit involving 186 gates of multiple types into an alternative form with a different topology, a far lower two-qubit gate count, and a smaller family of gate types. We test the scaling of our algorithm on up to 20 qubits, recompiling into circuits with up to 400 parameterized gates, and incorporate a novel adaptive timestep technique. We note that a classical simulation of the process can be useful to optimise circuits for today's prototypes, and more generally the method may enable `blind' compilation i.e. harnessing a device whose response to control parameters is deterministic but unknown.
22
Quantum Computing in the NISQ era and beyond
John Preskill · Quantum · 2018 · 8.2K citations · Full text
Computing, Computer Science, Physics +17
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi, Alexei Kitaev · Physical Review A · 2005 · 1.5K citations · Full text
Computing, Computer Science, Physics +14
Jian Ma, Xiaoguang Wang, C. P. Sun et al. · Physics Reports · 2011 · 858 citations · Full text
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
C. J. Ballance, T. P. Harty, Norbert M. Linke et al. · Physical Review Letters · 2016 · 784 citations · Full text