Quantum Simulation of Tunneling in Small Systems

Abstract

A number of quantum algorithms have been performed on small quantum computers; these include Shor's prime factorization algorithm, error correction, Grover's search algorithm and a number of analog and digital quantum simulations. Because of the number of gates and qubits necessary, however, digital quantum particle simulations remain untested. A contributing factor to the system size required is the number of ancillary qubits needed to implement matrix exponentials of the potential operator. Here, we show that a set of tunneling problems may be investigated with no ancillary qubits and a cost of one single-qubit operator per time step for the potential evolution. We show that physically interesting simulations of tunneling using 2 qubits (i.e. on 4 lattice point grids) may be performed with 40 single and two-qubit gates. Approximately 70 to 140 gates are needed to see interesting tunneling dynamics in three-qubit (8 lattice point) simulations.

4 pages, 2 figures

References in corpus (11)

• Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating chemistry using quantum computers
• Color Superfluidity and "Baryon" Formation in Ultracold Fermions
• Quantum simulation of the Klein paradox with trapped ions
• Atomic quantum simulator for lattice gauge theories and ring exchange models
• Wilson Fermions and Axion Electrodynamics in Optical Lattices
• Cold atom simulation of interacting relativistic quantum field theories
• Using Quantum Computers for Quantum Simulation
• Quantum simulation of the single-particle Schrodinger equation
• Yang-Mills gauge theories from fermionic lattice models