2002
DOI: 10.1103/physreva.66.054301
|View full text |Cite
|
Sign up to set email alerts
|

Simulation of chaos-assisted tunneling in a semiclassical regime on existing quantum computers

Abstract: We present a quantum algorithm which allows to simulate chaos-assisted tunneling in deep semiclassical regime on existing quantum computers. This opens new possibilities for investigation of macroscopic quantum tunneling and realization of semiclassical Schrödinger cat oscillations. Our numerical studies determine the decoherence rate induced by noisy gates for these oscillations and propose a suitable parameter regime for their experimental implementation.PACS numbers: 03.67. Lx, 05.45.Mt, 75.45.+j Since 1… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
11
1

Year Published

2003
2003
2020
2020

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 29 publications
2
11
1
Order By: Relevance
“…Grover's algorithm [12] was studied in [13] with the help of a phenomenological model of probability diffusion, but the dependence of the model parameters on the number of qubits and ǫ was not determined. Conclusions similar to those in [7] were reached also in [14], where again the test algorithm was Grover's one 1 , and in a number of articles about the simulation of quantum chaotic maps [9,15,16,17,18]. These results show that the timescale for the degradation of the fidelity of a q.c.…”
Section: Introductionsupporting
confidence: 56%
See 3 more Smart Citations
“…Grover's algorithm [12] was studied in [13] with the help of a phenomenological model of probability diffusion, but the dependence of the model parameters on the number of qubits and ǫ was not determined. Conclusions similar to those in [7] were reached also in [14], where again the test algorithm was Grover's one 1 , and in a number of articles about the simulation of quantum chaotic maps [9,15,16,17,18]. These results show that the timescale for the degradation of the fidelity of a q.c.…”
Section: Introductionsupporting
confidence: 56%
“…Up to now, this method follows exactly the procedure described in [16]. The set W does not contain duplicated elements, so that its cardinality is smaller or equal to p (but it is always positive).…”
Section: Appendix B: a Quantum Circuit For Exponentiationmentioning
confidence: 99%
See 2 more Smart Citations
“…[9,10]). Such systems are described by chaotic quantum maps and include the quantum baker map [11], the quantum kicked rotator [12], the quantum saw-tooth map [13] and the quantum double-well map [14]. For them a map iteration can be performed for N -size vector in O(n q 2 ) or O(n q 3 ) gates while a classical algorithm would need O(n q 2 nq ) operations.…”
Section: Introductionmentioning
confidence: 99%