2016
DOI: 10.1088/1751-8113/49/29/295301
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer

Abstract: Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a system of qubits. By exploiting the block diagonality of a fermionic Hamiltonian, we show that the number of required qubits can be reduced while the number of terms in the Hamiltonian will increase. All operations for this reduction can be performed in operator space. The scheme is conceived as a pre-computational step that would be performed prior to the actual quantum simulation. We ap… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
70
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 70 publications
(70 citation statements)
references
References 35 publications
(53 reference statements)
0
70
0
Order By: Relevance
“…A particular attention is dedicated to generating compact qubit forms for symmetry projectors, which was a problem discovered in earlier studies. 20,21 This appears to be possible only for some symmetries while for others only approximate expressions are feasible. Generally, time complexity of a single step of VQE is tied to the number of terms to be measured and their variances.…”
Section: Introductionmentioning
confidence: 99%
“…A particular attention is dedicated to generating compact qubit forms for symmetry projectors, which was a problem discovered in earlier studies. 20,21 This appears to be possible only for some symmetries while for others only approximate expressions are feasible. Generally, time complexity of a single step of VQE is tied to the number of terms to be measured and their variances.…”
Section: Introductionmentioning
confidence: 99%
“…In previous works, trading quantum resources has been addressed for general algorithms [29], and quantum simulations [30][31][32]. In the two works of Moll et al and Bravyi et al, qubit requirements are reduced with a scheme that is different from ours.…”
Section: Resultsmentioning
confidence: 99%
“…In [11], the actions on two qubits are replaced with their expectation values after inspection of the Hamiltonian. In [30], on the other hand, the Hamiltonian is reduced to two qubits in a systematic fashion. Finally, the case is revisited in [31], where the problem is reduced below the combinatorical limit to one qubit.…”
Section: The Physical Hamiltonianmentioning
confidence: 99%
See 1 more Smart Citation
“…[], where a superconducting circuit made of frequency‐tunable qubits and implementing two‐qubit controlled‐phase gates according to scheme (i) was used to probe the dynamics of a chain of nine interacting spins, starting in a factorized state and evolving along an adiabatic trajectory by switching on an anisotropic exchange interaction term. Recent results in hybrid quantum‐classical approaches, such as the VQE method already recalled at the end of the previous Section, have been efficiently employed to show quantum chemistry simulations on superconducting NISQ processors, in which the ground state energy of multi‐atomic molecules was calculated with precision approaching the chemical accuracy limits . Using an evolution of the VQE algorithm, nuclear physics quantum simulations have also been reported in superconducting quantum hardware, with the cloud computing of the deuteron binding energy .…”
Section: Experimental Achievements and Prospective Technologiesmentioning
confidence: 99%