npj Quantum Information · 2023 · 17 citations · 50 references
ComputingComputer SciencePhysicsAlgorithmsQuantum ComputingQuantum MechanicsQuantum CircuitsQuantum CompilationQuantum ComputationQuantum GatesQuantum Hardware ArchitecturesQuantum SimulationHamiltonian CircuitsHamiltonian SimulationHeisenberg ModelNon-clifford GatesQuantum Circuit CompilationQuantum Circuit SynthesisQuantum Gate SynthesisSymmetries
Abstract We provide an approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations. The total number of gates, especially CNOT, reduce in many cases. We show that it is possible to implement an exponentiated sum of commuting Paulis with at most m (controlled)-rotation gates, where m is the number of distinct non-zero eigenvalues (ignoring sign). Thus we can collect mutually commuting Hamiltonian terms into groups satisfying one of several symmetries identified in this work. This allows an inexpensive simulation of the entire group of terms. We further show that the cost can in some cases be reduced by partially allocating Hamiltonian terms to several groups and provide a polynomial time classical algorithm that can greedily allocate the terms to appropriate groupings.
50
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Fault-tolerant quantum computation by anyons
Alexei Kitaev · Annals of Physics · 2003 · 7.3K citations · Full text
Computing, Computer Science, Physics +12
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod R. McClean, Peter Shadbolt et al. · Nature Communications · 2014 · 4.6K citations · Full text
Natural Sciences, Chemistry, Physics +17
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text