2012
DOI: 10.1088/1367-2630/14/11/115023
|View full text |Cite
|
Sign up to set email alerts
|

Faster quantum chemistry simulation on fault-tolerant quantum computers

Abstract: Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on faulttolerant quantum computers; these methods generalize readily to other quantum simulation problems. Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource. To improve executio… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
61
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 110 publications
(64 citation statements)
references
References 69 publications
0
61
0
Order By: Relevance
“…Other operations in a quantum algorithm like routing of qubits for long-range interactions may become important. The resource savings factor for the entire algorithm will always be less than that for the individual Toffoli gates; still, most quantum algorithms like factoring [6,7,33] and simulation [34,35] benefit substantially from a more efficient Toffoli construction.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Other operations in a quantum algorithm like routing of qubits for long-range interactions may become important. The resource savings factor for the entire algorithm will always be less than that for the individual Toffoli gates; still, most quantum algorithms like factoring [6,7,33] and simulation [34,35] benefit substantially from a more efficient Toffoli construction.…”
Section: Discussionmentioning
confidence: 99%
“…We propose the term quantum logic synthesis for methods of synthesizing arbitrary-size, fault-tolerant quantum logic networks in a hierarchical arrangement of preparation and teleportation. The possible techniques go far beyond "sequential" decompositions [6][7][8]35], where a quantum algorithm is decomposed into a long sequence of fundamental gates from a small set. For each fundamental gate, faulttolerant constructions are known, but the cost of each is high because every operation must have very low error rate.…”
Section: Discussionmentioning
confidence: 99%
“…In faster quantum chemistry on fault tolerant quantum computers by Jones et al [32], the authors investigate how quantum simulations addressing quantum chemistry could be implemented within a device that already incorporates quantum error correction and therefore provides fault-tolerance, that is, already requires the main ingredients for universal quantum computation. They examine how to improve the efficiency in general and analyse, as a specific example, the ground-state energy calculation for lithium hydride.…”
Section: Relativistic Physicsmentioning
confidence: 99%
“…The details necessary for the simulation can be found elsewhere 18 including the desiderata for faulttolerant quantum simulations. 25 As a second example to illustrate the Wigner projections, consider cyclopropenyl cation, C 3 H + 3 , with D 3h symmetry in the second quantized representation. We restrict attention to the C 3 subgroup which has only one dimensional IRs.…”
Section: Examplesmentioning
confidence: 99%