Quantum Simulation of Tunneling in Small Systems

Details Quantum Simulation of Tunneling in Small Systems Quantum Simulation of Tunneling in Small Systems

2012-02-07

arxiv.org/abs/1202.1536v1

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum Simulation of Tunneling in Small Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Simulation of Tunneling in Small Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Simulation of Tunneling in Small Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-63552