The DOI matches its Crossref record; 511 of the 511 references it cites were found in a registry or an index; none of the 313 sources its claims cite is checked for support yet.
Quantum computational chemistry
Open accessAbstract
With small quantum computers becoming a reality, first applications are eagerly sought. Quantum chemistry presents a spectrum of computational problems, from relatively easy to classically intractable. Algorithms for the easiest of these have been run on the first quantum computers. But an urgent question is, how well will these algorithms scale to go beyond what is possible classically? This review presents strategies employed to construct quantum algorithms for quantum chemistry, with the goal that quantum computers will eventually answer presently inaccessible questions, for example, in transition metal catalysis or important biochemical reactions.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
This review provides a comprehensive introduction to quantum computational chemistry, bridging classical electronic structure methods and quantum algorithms for chemistry. It focuses on near-term variational algorithms with error mitigation and longer-term quantum phase estimation with error correction, and concludes that fault-tolerant chemistry simulations still require far more resources than current hardware.
Key findings
- Quantum computers can store the full configuration interaction wavefunction of M spin-orbitals using only M qubits in second quantisation, whereas classical FCI scales exponentially; the review identifies strongly correlated systems around 100–200 spin-orbitals as a target “sweet spot” for quantum advantage.
- For fault-tolerant phase estimation, resource estimates cited include FeMo-co (54 electrons, 108 spin-orbitals) requiring ~10^14 T gates and ~200 million physical qubits, running weeks/months; a later qubitization/low-rank approach for 113 electrons in 152 spin-orbitals reduced this to ~10^11 Toffoli gates and ~1 million physical qubits for 2 months.
- Condensed-phase/Fermi-Hubbard estimates are lower: ~2×10^8 T gates for a 128 spin-orbital 3D homogeneous electron gas and ~7.1×10^8 T gates for a 100-site 2D Fermi-Hubbard model, corresponding to ~2–3 million qubits for tens of hours; another Trotter estimate gives ~10^6 Toffoli and 10^7–10^8 T gates and ~400,000–600,000 physical qubits for a couple of hours.
- VQE measurement cost scales as O(M^6/ε^2) in a Gaussian orbital basis and O(M^4/ε^2) in a plane wave dual basis; UCCSD gate counts are O(M^3 N^2) with Jordan-Wigner, improved to O(M^3 N) with swap networks or O(M^3)–O(M^4) with low-rank decomposition.
Methods
- Design: narrative review, not a primary experimental or numerical study; it synthesizes classical computational chemistry (HF, MCSCF, CI, CC, basis sets, active-space reduction) and quantum computing (qubit encodings, Hamiltonian simulation, phase estimation, VQE, error mitigation).
- Data/sample: illustrative worked examples map H2 in STO-3G, 6-31G, and cc-PVDZ bases and LiH in STO-3G onto qubits, using Jordan-Wigner, Bravyi-Kitaev, and BK-tree mappings, natural molecular orbital active-space reduction, symmetry qubit removal, and UCCSD.
- Main analysis: qualitative and asymptotic resource comparisons between classical and quantum methods, with cited gate/qubit estimates for fault-tolerant and near-term algorithms.
Limitations
- The paper states that the field has grown beyond a single review and that it excludes complementary directions such as quantum machine learning for electronic structure, problem-decomposition approaches, hybrid DFT, relativistic quantum chemistry, molecular vibrations, analog simulators, quantum annealers, and non-Hermitian eigenvalue algorithms.
- The paper states that resource estimates depend on assumptions about hardware, error rates, error-correcting code, and fault-tolerance protocols; Trotter error bounds are believed loose by several orders of magnitude, and it is not yet possible to conclusively state which Hamiltonian simulation method will perform best.
- Evident from the text: as a review, it reports no new primary data or experimental results; its numerical resource figures are cited from prior works and are conditional on the stated error-correction and surface-code assumptions.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 of 313 cited sources checked · 0 supported · 0 flagged
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, the cost of storing the wavefunction scales exponentially with the number of electrons, N .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The diagonalised 1-RDM is given by Diag (1.96588, 0.00611, 0.02104, 0.0002, 0.00001, 0.00314, 0.00314, 0.00016, 0.00016, 0.00016).”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can see that the 5 th orbital has a NOON that is 20 times smaller than the next smallest NOON.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can see that the differences in energy between the three minima are considerably larger than chemical accuracy (1 . 6 mHartree).”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“which can reproduce the ground state given by Eq. (98).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIn the paper
“The exact application of these laws leads to equations much too complicated to be soluble.”
What the sources say
- Not checked yetcites Dirac, 1929
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIn the paper
“With only single qubit operations and CNOT gates, it is possible to approximate an arbitrary multi-qubit gate to any desired accuracy (DiVincenzo, 1995).”
What the sources say
- Not checked yetcites DiVincenzo, 1995
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesA conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This leaves classical computers unable to exactly simulate quantum systems in an efficient way.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIn the paper
“As quantum computers are able to efficiently simulate quantum systems”
What the sources say
- Not checked yetcites Feynman, 1982
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIn the paper
“The problem described by Dirac is that the complexity of the wavefunction of a quantum system grows exponentially with the number of particles.”
What the sources say
- Not checked yetcites Dirac, 1929
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- It may state two separate claims as one. 130
- Probably not a substantial claim. 148
- The quote only partly states this claim. 2
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In total, there are P 3 N × 2 N complex amplitudes, showing that the memory required scales exponentially with the size of the simulated system.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For LiH in the STO-3G basis, we consider { 1 s, 2 s, 2 p x , 2 p y , 2 p z } functions for lithium, and a single { 1 s } orbital for hydrogen. This gives a total of 12 spin-orbitals. We can reduce this problem to one of six qubits, as illustrated in Fig. 12.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The lowest energy computational basis state of ccPVDZ H 2 in the Jordan-Wigner encoding (18 qubits) is | 000000001000000001 〉 . The corresponding BK-tree mapped state (16 qubits) is given by | 0001011100010111 〉 .”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Our final Hamiltonian acts on 6 qubits, but differs in energy from the full 12 qubit Hamiltonian by only 0 . 2 mHartree.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The reader will find that the 9 th and 18 th orbitals store the number of spin up electrons and total number of electrons, respectively. As a result, they can be removed. This reduces the problem to one of 16 qubits.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The 1-RDM in the canonical orbital basis from a CISD calculation on LiH (at an internuclear separation of 1.45 ˙ A) is given by”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear? Based: unclearThe quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The JW mapped HF state (8 qubits) is given by | 00010001 〉 . Using the matrix given above, the BK mapped HF state (8 qubits) is | 00111011 〉 . When the two conserved qubits are removed, the BK mapped HF state (6 qubits) is | 011011 〉 .”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Finally, most of the prior work in quantum computational chemistry has focused on this problem.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
- Rests on an assumption: The electronic structure problem is a fundamental one in classical computational chemistry.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, we stress that to achieve this ultimate goal we would need considerable further developments - both in the technology required to build such as powerful quantum computer, and the theory behind an appropriate algorithm and model.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
- Rests on an assumption: Using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Despite ongoing experimental efforts, no group has yet demonstrated a single fully error corrected qubit.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Therefore any multi-qubit observable can be expanded into strings of Pauli operators, the expectation values of which we can measure efficiently with a quantum computer.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Knowledge of the energy eigenstates enables the prediction of reaction rates, location of stable structures, and determination of optical properties (Helgaker et al. , 2012).”
What the sources say
- Not checked yetcites Helgaker et al., 2012
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Despite being a relatively young field, quantum computational chemistry has grown extremely rapidly, and has already evolved beyond the stage that it can be fully described by a single review.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Secondly, the machinery developed to solve this problem on quantum computers is easily applied to other types of problems, such as finding transition states, or understanding the vibrational structure of molecules.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Moreover, the gate counts currently estimated for transformative chemistry simulations likely signal the need for quantum error correction, which requires orders of magnitude more qubits, and lower error rates, than are currently available (Babbush et al. , 2018b; Kivlichan et al. , 2019a; Mueck, 2015).”
What the sources say
- Not checked yetcites Babbush et al., 2018b
- Not checked yetcites Kivlichan et al., 2019a
- Not checked yetcites Mueck, 2015
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Experimental developments have accompanied these theoretical milestones, with many groups demonstrating proof of principle chemistry calculations.”
Strength:boosted· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, limited by hardware capabilities, these experiments focus only on small chemical systems that we are already able to simulate classically.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Pauli operators and identity matrix, multiplied by real coefficients, form a complete basis for any Hermitian single or multi-qubit operator.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The runtime and physical resources required by these algorithms are expected to scale polynomially with both the size of the system simulated and the accuracy required.”
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Feynman proposed a solution to this problem; using quantum hardware as the simulation platform”
What the sources say
- Not checked yetcites Feynman, 1982
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a result, the circuit model of quantum computing typically decomposes all algorithms into single and two qubit gates.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“To date, several efficient quantum algorithms have been proposed to solve problems in chemistry.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As a consequence, first quantised basis set methods are rarely, if ever, used in classical computational chemistry calculations.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The electronic structure problem has received significant attention since it was first introduced in the context of quantum computational chemistry by Aspuru-Guzik et al. (2005), and is widely considered to be one of the first applications of quantum computing.”
What the sources say
- Not checked yetcites Aspuru-Guzik et al., 2005
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As such, it may be better to treat the nuclei and electrons on an equal footing, which is best achieved with grid based methods.”
Tests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While classical computational chemistry has made tremendous progress in describing and predicting the properties of a multitude of systems, there are some systems that appear classically intractable to simulate with currently known techniques.”
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Grid based methods are useful when considering chemical reaction dynamics, or when simulating systems for which the Born-Oppenheimer approximation is not appropriate.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As we will see in Sec. III.B.2, the information encoded by a Slater determinant can be compressed by moving to the second quantised formalism.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Nevertheless, quantum computers with more than around 50 qubits are considered too large to exactly simulate classically, and may thus be capable of solving problems which are intractable on even the largest classical supercomputers (Arute et al. , 2019).”
What the sources say
- Not checked yetcites Arute et al., 2019
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, a variational circuit with set parameters is tailored to the time evolution of one or more specific initial states, in contrast to a Trotter circuit, which can be used to time evolve any valid initial state.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Driven by this potential utility, quantum computational chemistry is rapidly emerging as an interdisciplinary field requiring knowledge of both quantum computing and computational chemistry.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
- Rests on an assumption: Using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.
- Rests on an assumption: Quantum computers will enable a more accurate understanding of the models in use today, as well as the ability to simulate more complex (and therefore, more realistic) models.
In the paper
“Nevertheless, quantum computers with more than around 50 qubits are considered too large to exactly simulate classically, and may thus be capable of solving problems which are intractable on even the largest classical supercomputers (Arute et al. , 2019).”
What the sources say
- Not checked yetcites Arute et al., 2019
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As a consequence of the Pauli exclusion principle, the electronic wavefunction must be antisymmetric under the exchange of any two electrons.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
In the paper
“It is widely believed that this problem should be efficiently solvable with a quantum computer, for physically relevant systems (Whitfield et al. , 2013).”
What the sources say
- Not checked yetcites Whitfield et al., 2013
Load-bearingStrength:hedged· not yet calibratedTests✗ Asserted: fails✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. The authors may not put it forward as true. It may be too vague to check against evidence.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While the number of spin-orbitals considered, M , is typically larger than the number of electrons in the system, N , the electrons can only occupy N of the spin-orbitals in a given Slater determinant.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“In particular, Abrams and Lloyd (1999) showed that the phase estimation algorithm (Kitaev, 1995) can be used to find the energy of a quantum system, and collapse it into the desired energy eigenstate.”
What the sources say
- Not checked yetcites Abrams and Lloyd, 1999
- Not checked yetcites Kitaev, 1995
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, building a sufficiently large quantum computer will be a difficult scientific challenge.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is important to note that, while it is widely believed to be true, it has not yet been mathematically proven that BPP = BQP (where BPP is the complexity class containing problems that are solvable in polynomial time on a probabilistic classical computer).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Even if the individual energy values cannot be measured to within chemical accuracy, there is often a fortuitous cancellation of errors, which leads to the energy difference being found to chemical accuracy.”
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Computational models of FeMo-co have been proposed which are beyond the reach of current classical methods for solving strongly correlated systems (see Sec. VIII.A) but would be accessible with a small error corrected quantum computer (Berry et al. , 2019b; Reiher et al. , 2017).”
What the sources say
- Not checked yetcites Berry et al., 2019b
- Not checked yetcites Reiher et al., 2017
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Interestingly, this is the same regime that is believed to be most relevant to understanding cuprate superconductors (LeBlanc et al. , 2015).”
What the sources say
- Not checked yetcites LeBlanc et al., 2015
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, one key difference is that using a basis set is known as a 'Galerkin discretisation', which ensures that the energy converges to the correct value from above, as the number of basis functions tends to infinity.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“The Haber-Bosch process requires high temperatures and pressures, and is believed to consume up to 2 % of the world's energy output (Reiher et al. , 2017).”
What the sources say
- Not checked yetcites Reiher et al., 2017
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Nevertheless, to perform accurate simulations of large chemical systems, we will likely require digital quantum simulation, as it is not yet clear how to protect large analog simulations from errors.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“For example, if we consider using a quantum computer to factor numbers in polynomial time (Shor, 1994), current estimates (at time of writing) suggest that we would require around 20 million physical qubits to factor a number that is too large to tackle using known classical algorithms (Gidney and Eker, 2019).”
What the sources say
- Not checked yetcites Gidney and Eker, 2019
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Size consistency is important for obtaining the correct behaviour from calculations to determine reaction rates, as reactants at the beginning of the process are considered non-interacting.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Secondly, first quantised basis set approaches have found use in quantum computational chemistry, as we will discuss in Sec. IV.A.2.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Static correlation can arise because the wavefunction may require several determinants to be coupled in a proper spin configuration, or during bond breaking in order to account for the separation of the electrons onto the products (the latter case is often referred to as non-dynamic, or left-right correlation) (Lyakh et al. , 2012).”
What the sources say
- Not checked yetcites Lyakh et al. , 2012
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The CI method is effective at recovering dynamic correlation, but less effective at recovering static correlation (Helgaker et al. , 2014).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As these single-particle molecular orbitals are chosen such that they diagonalise the non-interacting (or mean-field) Hamiltonian, energy eigenstates can be formed by taking tensor products of each electron in a different molecular spin-orbital.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Although we will discuss orbital basis sets in more detail in Sec. III.D, we note here that the HF orbitals are not suitable for describing the virtual orbitals that electrons are excited into. This is because the HF method only optimises the occupied orbitals in the single Slater determinant wavefunction.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Slater determinant generated from a HF calculation is typically taken as the reference state for post-HF methods, such as configuration interaction and coupled cluster, which seek to capture some of the dynamic correlation energy by including additional determinants, describing excitations above the HF state.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“The MCSCF approach considers a wavefunction with several Slater determinants, and variationally optimises both the molecular orbitals, and the determinant amplitudes simultaneously (Roos et al. , 1980).”
What the sources say
- Not checked yetcites Roos et al. , 1980
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Systems with strong static correlation are defined as those where multiple Slater determinants are equally dominant.”
Tests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We then assume that each electron moves in the average charge distribution of all of the other electrons, which introduces an effective potential.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“These include excited states (Lischka et al. , 2018), transition states (Szalay et al. , 2012), systems at the dissociation limit (Lyakh et al. , 2012), and transition metals (Vogiatzis et al. , 2019).”
What the sources say
- Not checked yetcites Lischka et al. , 2018
- Not checked yetcites Szalay et al. , 2012
- Not checked yetcites Lyakh et al. , 2012
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As considering all determinants is classically intractable, the CI method is typically limited to including a small number of excitations above the reference state: single excitations (CIS), double excitations (CISD), and occasionally triple excitations (CISDT).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For more accurate results, the CCSD(T) method can be used, which treats the triple excitations pertubatively, and scales in time approximately as O ( M 7 ).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, this wavefunction contains a number of determinants which scales exponentially with the number of electrons, making large calculations classically intractable.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“To the best of our knowledge, second quantised grid based methods have only been discussed by Babbush et al. (2018c) in their Appendix A.”
What the sources say
- Not checked yetcites Babbush et al. (2018c)
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In order to obey the Pauli exclusion principle, these tensor products must be correctly antisymmetrised.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, while the methods described above are often effective at recovering the static correlation energy, they struggle to recover the dynamic correlation energy.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The RayleighRitz variational principle states that the energy expectation value of a parametrized wavefunction is greater than or equal to the lowest energy eigenvalue of the Hamiltonian being measured.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If all ( M N ) determinants are included, the wavefunction is known as the full configuration interaction (FCI) wavefunction.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Hartree-Fock (HF) method is a mean-field technique which aims to find the dominant Slater determinant in the system wavefunction. This is achieved by optimising the spatial form of the spin-orbitals to minimise the energy of the wavefunction.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This can be achieved by creating Slater determinants from the molecular orbitals, as described by Eq. (21).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“The canonical implementation of CCSD does not store the wavefunction, as this would be exponentially costly (as the CCSD wavefunction has support on all possible Slater determinants). Instead, coupled non-linear equations can be derived. The solution to these equations is the CCSD approximation to the ground state (Helgaker et al. , 2014; Purvis and Bartlett, 1982).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
- Not checked yetcites Purvis and Bartlett, 1982
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We note that in practice, the molecular orbitals obtained by diagonalising the non-interacting part of the Hamiltonian will likely form a poor basis for the system.”
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In the HF method, we first neglect the Coulomb repulsion term in the electronic structure Hamiltonian (Eq. (17)), reducing the problem to one of N independent electrons.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This Hamiltonian has only O ( M ) terms, where M is the number of spin-sites.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Dynamic correlation is a typically small correction (Hattig et al. , 2012), arising from the Coulomb repulsion between electrons.”
What the sources say
- Not checked yetcites Hattig et al. , 2012
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“These two metrics are closely related, and while either can be used, the latter produces more compact basis sets, and hence is used more frequently in practice (Helgaker et al. , 2014).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Observables must be independent of the representation used.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, as a mean-field solution, the HF method neglects the effects of dynamic and static correlation in the wavefunction.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The importance of each of the virtual atomic orbitals is determined by their contribution to either the electron density (atomic natural orbitals) or the atomic correlation energy (correlation-consistent basis sets).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Static correlation occurs when more than one Slater determinant is equally dominant in the wavefunction (Hattig et al. , 2012).”
What the sources say
- Not checked yetcites Hattig et al. , 2012
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The coupled cluster (CC) method also includes additional determinants to recover the correlation energy, but uses a product parametrization.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If all determinants are included, we recover the full configuration interaction (FCI) wavefunction, generated by considering all excitations above the Hartree-Fock wavefunction”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The time taken to solve these equations scales as O (( M -N ) 4 N 2 ) (Purvis and Bartlett, 1982), while the memory needed to store the molecular integrals needed scales as O ( M 4 ).”
What the sources say
- Not checked yetcites Purvis and Bartlett, 1982
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The configuration interaction (CI) method generates a correlated wavefunction by considering excitations above a reference state, typically the Hartree-Fock state.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“When all of the excitation operators T i are included, the CC method recovers the full configuration interaction wavefunction - however, performing this calculation would be exponentially costly.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Kivlichan et al. (2017) also showed that there exist systems where the grid spacing must decrease exponentially with the number of particles in the system to maintain constant accuracy. Consequently, these systems are not efficient to simulate using this method.”
What the sources say
- Not checked yetcites Kivlichan et al. (2017)
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Although the Schr¨ odinger equation can be solved exactly for one electron atoms, the orbitals obtained become diffuse too rapidly to accurately describe manyelectron atoms, especially close to the nuclei (Helgaker et al. , 2014).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These basis sets can be further improved by adding additional orbitals with higher angular momenta, which make the angular part of the wavefunction more flexible. These orbitals are called 'polarisation functions', as they describe the polarisation of atomic charge caused by bonding (for example, the 6-31G* basis).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Additional accuracy can be obtained by using cc-PV n Z basis sets (correlation consistent polarised valence n zeta), introduced by Dunning Jr. (1989). These include additional unoccupied ('virtual') orbitals to recover the correlation energy. The virtual orbitals are generated from correlated calculations on atoms.”
What the sources say
- Not checked yetcites Dunning Jr. (1989)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As ρ 1 is a Hermitian operator, we can diagonalise it with a unitary transform. This is a basis change from the canonical orbitals to the 'natural molecular orbitals'. The diagonal elements of the basis transformed ρ 1 are called the natural orbital occupation numbers (NOONs).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Spin-orbitals with a NOON close to 0 or 1 (compared to the other NOONs) can be assumed to be empty or occupied, respectively.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Using a grid based method, rather than basis sets, means that the Born-Oppenheimer approximation is not required. As a result, we are able to treat the electrons and nuclei on an equal footing using grid based methods, which can be important for systems undergoing reactions.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The number of orbitals considered determines the runtime and memory requirements of classical chemistry algorithms. In the case of quantum computational chemistry, the number of basis functions determines the number of qubits and gate operations required to solve the problem”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The simulation of chemical systems using a grid based method can require considerably more qubits than in basis set approaches. For example, it would require 96 logical qubits to store the position of a single spinless particle to 32 bits of accuracy using a grid based approach. This can be contrasted with basis set approaches, where interesting molecules or Fermi-Hubbard models could be simulated”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“This reduces the number of Hamiltonian terms from O ( M 4 ) to O ( M 3 ) in the plane wave basis, and O ( M 2 ) in the plane wave dual basis.”
What the sources say
- Not checked yetcites Babbush et al. , 2018c
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While the STO functions exhibit many desirable features, they make evaluating the two-electron integrals in Eq. (28) computationally expensive.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These can be obtained by numerically solving the Schr¨ odinger equation using grid based methods with a very fine grid spacing, which is only possible for small atoms or simple molecules.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Moreover, the conventional CC method described above is a single determinant reference state method. Consequently, it does not tend to perform well when applied to multireference states, which are required to treat systems with strong static correlation (Lischka et al. , 2018; Lyakh et al. , 2012).”
What the sources say
- Not checked yetcites Lischka et al. , 2018
- Not checked yetcites Lyakh et al. , 2012
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These plane wave basis sets are well suited to periodic systems, and have a long history of use in classical density functional theory calculations.”
Strength:boosted· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“However, this limitation is compensated by the ease of integral evaluation. Furthermore, the disadvantages of GTOs are less prominent in molecular calculations (Helgaker et al. , 2014).”
What the sources say
- Not checked yetcites Helgaker et al. , 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“A similar reduction in the number of Hamiltonian terms can be obtained using gausslet basis sets (White, 2017), or 'discontinuous Galerkin' sets (McClean et al. , 2019a), which can both require fewer functions to accurately describe individual molecules than plane wave basis sets.”
What the sources say
- Not checked yetcites White, 2017
- Not checked yetcites McClean et al. , 2019a
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Calculations using minimal basis sets are of limited accuracy, giving only a qualitative description of the system.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Those authors also provide a technique to improve the energy estimate from a calculation by optimising the active space using orbital rotations, as is done in MCSCF calculations (Sec. III.C.2).”
What the sources say
- Not checked yetcites Takeshita et al. (2019)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The BK-tree mapping is uniquely defined even when the number of orbitals, M , is not a power of 2. As a result, when using the BK-tree mapping we are always able to use the qubit reduction by symmetry technique, which we will discuss in Sec. IV.C. We have observed that it is only possible to use this technique with the standard BK mapping when the number of orbitals is a power of two.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Because of its product parametrization, the CC method generates a trial wavefunction which includes all possible determinants, albeit with an incorrect parametrization. It therefore provides faster convergence than the configuration interaction method.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“From the definition above, we can see that the diagonal elements of ρ 1 are the expectation values of the number operator for the corresponding orbitals.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“More accurate basis sets can be formed by adding increased radial flexibility to the valence orbitals (the orbitals of the highest occupied energy level), by considering a double-zeta representation of the valence orbitals. This can be achieved using split-valence (Ditchfield et al. , 1971) basis sets, such as the 6-31G basis.”
What the sources say
- Not checked yetcites Ditchfield et al. , 1971
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As discussed in Sec. III.B.2, the full configuration interaction wavefunction contains a number of determinants which scales exponentially with the number of electrons, as roughly O ( M N ). As such, it requires an amount of memory that scales exponentially with the system size.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“STOn G basis sets are often called minimal basis sets, as they contain only the orbitals required to write the Hartree-Fock (HF) state (and those orbitals of similar energy).”
What the sources say
- Not checked yetcites Hehre et al. , 1969
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“This was improved by Berry et al. (2018), who used a circuit with O ( N log c 2 ( N )log 2 ( M )) gates, with a depth of O (log c 2 ( N )log 2 log 2 ( M )), where c ⩾ 1 and depends on the choice of sorting network used, and O ( N log 2 ( N )) ancilla qubits.”
What the sources say
- Not checked yetcites Berry et al. (2018)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The product parametrization also ensures size extensivity and size consistency.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“There are up to O ( N 2 M 4 ) possible 2-body terms, each leading to up to O (2 2log 2 ( M ) ) Pauli terms - meaning the Hamiltonian can contain up to O ( N 2 M 6 ) Pauli terms, which are up to 2log 2 ( M )-local.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of qubits required to store the wavefunction using the different encoding methods. M is the number of spin-orbitals used in a basis set simulation, N is the number of simulated particles in the problem, and m = log 2 ( P ), where P is the number of grid points per axis for a grid based simulation.”
- Also stated in: § IV. QUANTUM COMPUTATIONAL CHEMISTRY MAPPINGS · p. 20 · plain
“| First quantised, basis sets | N ⌈ log 2 ( M ) ⌉ |”
- Also stated in: § 1. Grid based methods · p. 20 · plain
“As a result, it only requires (3 m + 1) N qubits to store the N electron wavefunction described by Eq. (40).”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one. The quote only partly states this claim.
- Also stated in: § IV. QUANTUM COMPUTATIONAL CHEMISTRY MAPPINGS · p. 20 · plain
In the paper
“A thorough comparison of the BK and JW mappings was performed by Tranter et al. (2018) for 86 molecular systems. They found that the BK transform was at least as efficient, in general, as the JW transform when finding the ground states of the molecular systems. In many cases using the BK transform made the calculations considerably more efficient.”
What the sources say
- Not checked yetcites Tranter et al. (2018)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“While these basis sets result in an accurate description of the system with relatively few basis functions, they also lead to Hamiltonians containing up to O ( M 4 ) terms.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The most common basis sets construct approximate STOs from linear combinations of GTOs. These approximate STOs are used as the basis functions for our atomic orbitals.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The core orbitals have a single-zeta representation, while the valence orbitals have an n -zeta representation. The virtual orbitals considered are polarisation functions, with higher angular momenta than the valence orbitals. The polarisation functions are selected by the size of their contribution to the correlation energy.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“The original approach, by Abrams and Lloyd (1997), accomplished this using O ( N 2 log 2 2 ( M )) gates and O ( N log 2 ( M )) ancilla qubits.”
What the sources say
- Not checked yetcites Abrams and Lloyd (1997)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Because of the dependence on r 2 in the exponent, GTOs are more localised than STOs. As a result, GTOs do not approximate the atomic charge distribution as well as STOs, so more are required to describe a given orbital.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“However, those authors noted that such pathological cases can also exist for basis set methods, but are typically dealt with efficiently using a clever choice of basis function.”
What the sources say
- Not checked yetcites Kivlichan et al. (2017)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is difficult to know the size of the gap along the entire adiabatic path a priori , restricts our ability to perform ASP in the minimum amount of time.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Verstraete and Cirac (2005) developed a scheme to eliminate the strings of Z operators introduced by the JW transform, resulting in qubit operators with the same locality as the fermionic operators. This is achieved by doubling the number of qubits.”
What the sources say
- Not checked yetcites Verstraete and Cirac (2005)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Firstly, it is necessary for the register to initially be in a state with a non-zero overlap with the target eigenstate.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
In the paper
“There are also errors arising from constructing arbitrary gates from a discrete set of gates - such as approximating single qubit rotations from multiple T and Hadamard gates. These are typically referred to as circuit synthesis errors, ϵ CS , and can be quantified using techniques such as the Solovay-Kitaev theorem (Dawson and Nielsen, 2005).”
What the sources say
- Not checked yetcites Dawson and Nielsen, 2005
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We note that most of the work to date in quantum computational chemistry has focused on second quantised basis set methods.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Motta et al. (2018) utilised a low rank decomposition of the Hamiltonian in a Gaussian orbital basis to reduce the cost of time evolution. This decomposition is made possible by the structure present in the molecular Hamiltonian, which arises from the pairwise nature of the electron-electron interactions. Those authors leveraged a doubly factorised Cholesky decomposition of the Hamiltonian, with”
What the sources say
- Not checked yetcites Motta et al. (2018)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“To realise the standard phase estimation algorithm given above, we sequentially need to time evolve the main register under the Hamiltonian H for times t 0 = 2 π, t 1 = 4 π, ..., t ω -1 = 2 ω π . The total coherent time evolution, T , is then given by approximately T = 2 ω +1 π .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We remark that while this transformation leaves the ground state of the system unchanged, it does alter the excited states that can be found. In particular, we are restricted to finding those states with an electron number and total s z value equal to the values determined as described above.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- Rests on an assumption: For non-relativistic molecules, the total number of electrons and the total s_z value are conserved by the Hamiltonian.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While first quantised basis set simulations require asymptotically fewer qubits than second quantised basis set simulations, for the smallest simulable systems (such as small molecules in minimal basis sets), second quantised basis set methods require either fewer qubits and/or shorter gate sequences.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In the JW, parity and BK encoding methods, the number of qubits is equal to the number of spin-orbitals considered, M .”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices. As a result, the BKSF transform may require fewer gates than the JW mapping.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- The authors state this as an assumption: Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices.
In the paper
“Using Eq. (61), for a success probability of p = 0 . 5, we require ω = n + 2 ancilla qubits. The total evolution time can be related to the binary precision ϵ PE = 1 / 2 n , to show that T = 8 π/ϵ PE . Given that our success probability for this estimate is p = 0 . 5, we expect to have to repeat the procedure twice to obtain a good estimate of the ground state. This is equivalent to a total of 16”
What the sources say
- Not checked yetcites Reiher et al. , 2017
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As discussed above, both the canonical phase estimation algorithm and adiabatic state preparation require implementation of the time evolution operator, e -iHt , where H may or may not be time dependent.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Reiher et al. (2017) noted that the true scaling may be closer to O ( M 2 / min t ∆( t )).”
What the sources say
- Not checked yetcites Reiher et al., 2017
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“It is important to note that the gate counts of all product formula based methods scale as O (poly(1 /ϵ )).”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Secondly, we must have a way to coherently implement a unitary operator defined by an efficiently invertible function of the Hamiltonian.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Taylor series and quantum signal processing + qubitization algorithms scale exponentially better with regards to the accuracy of the simulation than product formula based methods.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“For the case of a molecular Hamiltonian Reiher et al. (2017) showed that a number of calls scaling as π/ 2 ϵ PE will suffice.”
What the sources say
- Not checked yetcites Reiher et al. (2017)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The UCC ansatz is typically truncated at a given excitation level - usually single and double excitations (known as UCCSD).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Firstly, the VQE is a heuristic method; it is currently unclear whether the quantum circuits proposed will yield better approximations of the ground state than the classical methods already available.”
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Secondly, the number of measurements required to obtain the energy to the desired accuracy can be large.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The UCC method retains all of the advantages of the CC method, with the added benefits of being fully variational, and able to converge when used with multireference initial states.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“McClean et al. (2018) showed that using hardware efficient ans¨ atze with random initial parameters makes the energy gradient essentially zero among most directions of Hilbert space, making classical optimisation extremely difficult.”
What the sources say
- Not checked yetcites McClean et al., 2018
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The plane wave and plane wave dual basis sets reduce the number of terms in the Hamiltonian to O ( M 3 ) and O ( M 2 ), respectively.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The VQE aims to find the lowest eigenvalue of a given Hamiltonian, such as that of a chemical system.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As described in Sec. III.B.2, the Fermi-Hubbard Hamiltonian contains O ( M ) terms, many of which commute with each other.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The VQE is a hybrid quantum-classical algorithm.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The VQE relies upon the Rayleigh-Ritz variational principle.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
In the paper
“This has been improved to O ( M 3 N ) gates, with a depth of O ( M 2 N ) using swap networks (O'Gorman et al. , 2019)”
What the sources say
- Not checked yetcites O'Gorman et al., 2019
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
- The authors state this as an assumption: A single Trotter step can be used to implement the UCC operator.
None of the sources cited for this claim have been checked yet.
In the paper
“The UCC method is intractable on classical computers, but can be efficiently implemented on a quantum computer.”
What the sources say
- Not checked yetcites Yung et al. (2014)
- Not checked yetcites Peruzzo et al. (2014)
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“It appears to be robust against some errors (McClean et al. , 2016; O'Malley et al. , 2016), and capable of finding the ground state energies of small chemical systems using low depth circuits (Kandala et al. , 2017).”
What the sources say
- Not checked yetcites McClean et al., 2016
- Not checked yetcites O'Malley et al., 2016
- Not checked yetcites Kandala et al., 2017
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Using the Taylor series method, algorithms were developed which scale as O ( M 5 ) (Babbush et al. , 2016) and O ( N 2 M 3 ) (Babbush et al. , 2017) for molecules in Gaussian basis sets.”
What the sources say
- Not checked yetcites Babbush et al., 2016
- Not checked yetcites Babbush et al., 2017
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Direct search methods (such as Nelder-Mead simplex (Hempel et al. , 2018; Peruzzo et al. , 2014; Shen et al. , 2017), simulated annealing (Hempel et al. , 2018), particle swarm (Colless et al. , 2018; Santagati et al. , 2018) covariance matrix adaptation (Sagastizabal et al. , 2019), and the dividing rectangles algorithm (Kokail et al. , 2019)) were found to exhibit good convergence to the ground”
What the sources say
- Not checked yetcites Hempel et al., 2018
- Not checked yetcites Peruzzo et al., 2014
- Not checked yetcites Shen et al., 2017
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“McClean et al. (2016) showed that it is important to consider the covariances between Hamiltonian terms within groups, as if these covariances are positive, then it may be better to measure the terms separately.”
What the sources say
- Not checked yetcites McClean et al. (2016)
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“They reduced the number of gates required to implement a Trotter step of the Hamiltonian to O ( M 2 log 2 ( M )) with increasing molecular size, and O ( M 3 ) for fixed molecular size and increasing basis size.”
What the sources say
- Not checked yetcites Motta et al., 2018
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Recent numerical work has explored the possibility of using classical neural networks to optimise VQE circuits for small instances of the Fermi-Hubbard model (Verdon et al. , 2019; Wilson et al. , 2019). This approach (known as 'meta-learning') works by training the neural networks on many random instances of the system being studied. The networks were able to successfully 'learn' to optimise the”
What the sources say
- Not checked yetcites Verdon et al., 2019
- Not checked yetcites Wilson et al., 2019
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“This leads to a scaling of O ( M 6 /ϵ 2 ) in a Gaussian orbital basis, and O ( M 4 /ϵ 2 ) for a plane wave dual basis (Babbush et al. , 2018c; Cao et al. , 2019; McClean et al. , 2014).”
What the sources say
- Not checked yetcites Babbush et al., 2018c
- Not checked yetcites Cao et al., 2019
- Not checked yetcites McClean et al., 2014
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“Moreover, we can use classically tractable methods to get initial approximations for the remaining non-zero parameters (O'Malley et al. , 2016; Romero et al. , 2019), which makes the classical optimisation step of the VQE easier.”
What the sources say
- Not checked yetcites O'Malley et al., 2016
- Not checked yetcites Romero et al., 2019
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“The simultaneous perturbation stochastic approximation (SPSA) algorithm, has also been used to successfully find the ground state energy of small molecules, despite relatively large uncertainties due to shot noise, and physical error rates (Ganzhorn et al. , 2018; Kandala et al. , 2017, 2018).”
What the sources say
- Not checked yetcites Ganzhorn et al., 2018
- Not checked yetcites Kandala et al., 2017
- Not checked yetcites Kandala et al., 2018
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“It has also been noted (Kivlichan et al. , 2018) that it is possible to use locality preserving mappings (Jiang et al. , 2018a; Verstraete and Cirac, 2005) to perform Trotter steps in constant depth. However, this comes at a cost of requiring additional qubits, and may have a large constant factor gate overhead.”
What the sources say
- Not checked yetcites Kivlichan et al., 2018
- Not checked yetcites Jiang et al., 2018a
- Not checked yetcites Verstraete and Cirac, 2005
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“This problem was partly mitigated by using a good initialisation strategy, such as using a chemically motivated (M¨ ollerPlesset) guess for UCC excitation amplitudes (Romero et al. , 2019).”
What the sources say
- Not checked yetcites Romero et al., 2019
Strength:plain· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“The approach also demonstrated some resilience to noise included in the simulations (Wilson et al. , 2019).”
What the sources say
- Not checked yetcites Wilson et al., 2019
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Direct search algorithms are considered more robust to noise than gradient based methods, but may require more function evaluations (Kolda et al. , 2006).”
What the sources say
- Not checked yetcites Kolda et al., 2006
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
In the paper
“Kivlichan et al. (2018) showed that for Hamiltonians of this form, we can implement Trotter steps in depth O ( M ), using O ( M 2 ) two qubit gates.”
What the sources say
- Not checked yetcites Kivlichan et al. (2018)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Jiang et al. (2018b) improved this result for the case of a 2D array of qubits with nearest-neighbour connectivity. They showed that it is possible to prepare initial states of the Fermi-Hubbard model using O ( M 1 . 5 ) gates, and perform Trotter steps of the Hamiltonian using O ( M ) gates for each Trotter step.”
What the sources say
- Not checked yetcites Jiang et al. (2018b)
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A limitation of the majority of these studies is that realistic noise has rarely been considered, so it is still unclear exactly how effective each method may be in practice.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
In the paper
“However, this approach has been questioned by Grimsley et al. (2019) who found that depending on how the operators in the Trotterized UCCSD ansatz are ordered, the optimised energies of systems displaying significant electron correlation can vary by amounts larger than chemical accuracy.”
What the sources say
- Not checked yetcites Grimsley et al. (2019)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Some authors have also considered using additional unitary transforms to enable more terms to be grouped, reducing the number of groups of terms from O ( M 4 ) to O ( M 3 ) (Crawford et al. , 2019; Gokhale et al. , 2019; Gokhale and Chong, 2019; Jena et al. , 2019; Yen et al. , 2019b; Zhao et al. , 2019).”
What the sources say
- Not checked yetcites Crawford et al., 2019
- Not checked yetcites Gokhale et al., 2019
- Not checked yetcites Gokhale and Chong, 2019
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This technique can be generalised to any ansatz with a repeating, layered structure.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The ansatz is composed of S layers.
None of the sources cited for this claim have been checked yet.
In the paper
“The extrapolation method (Li and Benjamin, 2017; Temme et al. , 2017) works by intentionally increasing the dominant error rate, ϵ 0 , by a factor λ , and inferring the error free result by extrapolation.”
What the sources say
- Not checked yetcites Li and Benjamin, 2017
- Not checked yetcites Temme et al., 2017
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is important to note that error mitigation schemes are not a scalable solution to the problem of noise in quantum hardware. In order to scale up computations to arbitrarily large sizes, fault-tolerant, error corrected quantum computers are required.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Overall, simulated VQE calculations on small molecules were sped up by a factor of 2 to 4 (Barkoutsos et al. , 2018).”
What the sources say
- Not checked yetcites Barkoutsos et al., 2018
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These contraction VQE methods differ from the overlap based methods, in that they obtain all of the eigenstates at the same time, rather than sequentially. Consequently, all eigenstates should be obtained to a similar accuracy.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The SWAP test approach requires a circuit that has twice as many gates as the ansatz used (but is of the same depth), and has twice as many qubits.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt may state two separate claims as one.
In the paper
“The probabilistic error cancellation method described above has been shown to work for general Markovian noise (Endo et al. , 2017), and has also been extended to work with temporally correlated errors and low frequency noise (Huo and Li, 2018).”
What the sources say
- Not checked yetcites Huo and Li, 2018
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Because only the correlation energy is calculated, fewer measurements are required and classical optimisation becomes easier.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These techniques are only effective when used with low depth circuits, such that the total error rate in the circuit is low.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
In the paper
“The quantum subspace expansion (QSE) method was originally introduced to find excited states (McClean et al. , 2017a), but has proven to be one of the most useful techniques introduced to near-term quantum computational chemistry, with benefits including better ground state estimation (discussed below) and mitigation of hardware errors (discussed in Sec. VI.C).”
What the sources say
- Not checked yetcites McClean et al., 2017a
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“The quantum subspace expansion (QSE) (McClean et al. , 2017a) described in Sec. V.C.1 can mitigate errors in the VQE, in addition to calculating the excited energy eigenstates.”
What the sources say
- Not checked yetcites McClean et al. , 2017a
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This method is most effective at correcting systematic errors, but can also suppress some stochastic errors.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“The probabilistic error cancellation method has been experimentally demonstrated on both superconducting (Song et al. , 2018) and trapped ion (Zhang et al. , 2019) systems.”
What the sources say
- Not checked yetcites Song et al. , 2018
- Not checked yetcites Zhang et al. , 2019
Strength:boosted· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The overhead γ determines the number of additional measurements required to keep the variance of the error mitigated result equal to the variance of the noisy result.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“They found the EoM method to be robust to noise when demonstrated experimentally, and more accurate for finding excitation energies than the QSE, in numerical tests.”
What the sources say
- Not checked yetcites Ollitrault et al. (2019)
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Because realising the inverse channel is in general an unphysical process, we use the scheme depicted in Fig. 9 to effectively realise the inverse channel by focusing only on measurement results.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, it may be difficult to find a unitary circuit that simultaneously prepares many eigenstates on an equal footing, which may make these contraction methods difficult to realise in practice.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“The latter method appears to be the most powerful of these, requiring a modest additional circuit depth, limited connectivity, and enabling effective post-selection on the electron number and s z value, rather than just the parities of these quantities.”
What the sources say
- Not checked yetcites Huggins et al. , 2019b
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Otten and Gray (2018b) have also extended the extrapolation method to the scenario where the error rates of different gates are increased by different factors.”
What the sources say
- Not checked yetcites Otten and Gray (2018b)
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While this method can improve the accuracy of calculations, it requires additional measurements in order to keep the variance of the measured observable the same as the non-extrapolated case.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The main drawback of the QSE is the large number of measurements that may be required to obtain the 4-RDM of the system. In general there are O ( M 8 ) elements to measure in the 4-RDM, compared to O ( M 4 ) elements for the Hamiltonian.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As discussed in Sec. II.A, physical qubits accumulate errors during computation, due to their interaction with the environment, and our imperfect control.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
None of the sources cited for this claim have been checked yet.
In the paper
“Tensor network methods, such as density matrix renormalisation group (DMRG), have proven effective for dealing with systems displaying strong static correlation. They provide an alternative approach to CASSCF (see Sec. III.C.2) approaches (Knecht et al. , 2016), allowing the treatment of larger active spaces, including those of metalloenzyme complexes with active spaces of over 70 spin-orbitals (K”
What the sources say
- Not checked yetcites Kurashige et al. , 2013
- Not checked yetcites Sharma et al. , 2014
- Not checked yetcites Lischka et al. , 2018
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We will see that the resources required are considerably greater than what we currently have available, at time of writing.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“For example, both the generalised Bravyi-Kitaev superfast transform (Setia et al. , 2018), and the majorana loop stabiliser code (Jiang et al. , 2018a) (discussed in Sec. IV.B.3) introduce additional qubits, whose values are constrained by the mappings.”
What the sources say
- Not checked yetcites Setia et al. , 2018
- Not checked yetcites Jiang et al. , 2018a
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“In the context of condensed matter physics, these calculations are referred to as 'exact diagonalisation' and are possible up to system sizes of around 20 to 30 lattice sites, in the case of Fermi-Hubbard models (Jiang et al. , 2018b; Yamada et al. , 2005).”
What the sources say
- Not checked yetcites Jiang et al. , 2018b
- Not checked yetcites Yamada et al. , 2005
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, these techniques can struggle to achieve highly accurate results for strongly correlated systems, and are not systematically improvable.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Other methods of error mitigation have been proposed, but require further research in order to assess how they can be best incorporated into chemistry calculations.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a result, we consider this spatial orbital to always be empty, and so remove all terms involving it from the Hamiltonian. This leaves a Hamiltonian acting on M = 18 spin-orbitals.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, in practice it is not always necessary to perform highly accurate calculations on the entirety of a large molecule or enzyme. Instead, problem decomposition approaches can be utilised”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“However, Monte Carlo methods are not without their own shortcomings, including the infamous 'sign problem', that affects fermionic simulations (Austin et al. , 2012; Ortiz et al. , 2001).”
What the sources say
- Not checked yetcites Austin et al. , 2012
- Not checked yetcites Ortiz et al. , 2001
Strength:boosted· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Hempel et al. (2018) simplified the UCCSD operator for H 2 by implementing the single excitation terms as basis rotations, and combining terms in the double excitation operator”
What the sources say
- Not checked yetcites Hempel et al. (2018)
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
In the paper
“Exact results (albeit with a less accurate model of the system) can also be obtained by carrying out basis set, full configuration interaction (FCI) calculations (Sec. III.B.2), which are less computationally expensive than grid based approaches. However, the cost of these calculations still scales exponentially with the system size, so they are only applicable to small systems, like the dinitrog”
What the sources say
- Not checked yetcites Rossi et al. , 1999
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“These systems are too strongly correlated to be tackled with methods like HF, DFT or even CCSD. They are also too large to be reliably dealt with using DMRG or quantum Monte Carlo, and much too large for classical FCI methods.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Grid-based simulations (as described in Sec. III.B.1) provide the most accurate results - but can only be carried out for a very small number of particles, because of the large number of grid points required.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The first determinant in the ground state wavefunction is the HF state for H 2 , showing that a mean-field solution is a good approximation for this molecule at this interatomic distance.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These calculations are often very efficient to run, and can treat large systems.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We do not expect these calculations to be replaced by those on quantum computers, given the large system sizes that are simulated.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it.
In the paper
“One such method is the quantum variational error corrector (Johnson et al. , 2017), which uses a variational algorithm to construct noise-tailored quantum memories.”
What the sources say
- Not checked yetcites Johnson et al. , 2017
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Tensor network methods are also useful for treating systems in condensed matter physics, including Fermi-Hubbard models that are accurate to around 100 sites (LeBlanc et al. , 2015).”
What the sources say
- Not checked yetcites LeBlanc et al. , 2015
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In general, the cost of applying these methods grows with the accuracy of the results that they produce, and the size of the system simulated.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
None of the sources cited for this claim have been checked yet.
In the paper
“Quantum Monte Carlo has many variants, and has been used to obtain results comparable to FCI in relatively small systems (the Cr 2 molecule with 24 active electrons in 30 spin-orbitals (Tubman et al. , 2016), or the fluorine atom in a cc-PV5Z basis with additional basis functions (Booth and Alavi, 2010)), as well as state of the art results in Fermi-Hubbard systems that are accurate to around 100”
What the sources say
- Not checked yetcites Tubman et al. , 2016
- Not checked yetcites Booth and Alavi, 2010
- Not checked yetcites LeBlanc et al. , 2015
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The first orbital has a NOON close to two, and so we consider it to always be doubly occupied. We can then remove any terms containing a † 0 , a 0 , a † 1 , a 1”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“By post-processing measurements from multiple iterations, they could detect some errors, or effectively realise a limited form of error correction.”
What the sources say
- Not checked yetcites McClean et al. (2019b)
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In contrast, the fourth orbital has a very small NOON. As a result, we assume that this orbital is never occupied, and so remove the two corresponding fermion operators from the Hamiltonian. This leaves a Hamiltonian acting on 8 spin-orbitals.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
- The authors state this as an assumption: The fourth orbital in the LiH NMO 1-RDM is never occupied.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As we have discussed throughout this review, a small quantum computer, with around 100 perfect qubits, would be able to calculate the FCI energy of a system with around 100 spin-orbitals in polynomial time.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds.
In the paper
“Initial work suggested that around 10 18 gates would be necessary to perform phase estimation on a system of around 100 spin-orbitals (excluding the overhead of error correction) (Wecker et al. , 2014).”
What the sources say
- Not checked yetcites Wecker et al. , 2014
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Another example is individual error reduction (Otten and Gray, 2018a). This method uses error correction to protect a single qubit, while leaving the rest of the physical qubits subject to noise. The process is repeated several times, with each physical qubit being protected in turn.”
What the sources say
- Not checked yetcites Otten and Gray, 2018a
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“While CC methods can also be applied to strongly correlated systems (LeBlanc et al. , 2015; Watson and Chan, 2012), higher excitation degrees are often required, making the method more costly to implement.”
What the sources say
- Not checked yetcites LeBlanc et al. , 2015
- Not checked yetcites Watson and Chan, 2012
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
None of the sources cited for this claim have been checked yet.
In the paper
“This is because these non-Clifford gates cannot be natively implemented in a fault-tolerant way in the surface code, but instead are typically implemented using magic state distillation and teleportation (Bravyi and Kitaev, 2005), which is often expensive (Campbell et al. , 2017).”
What the sources say
- Not checked yetcites Bravyi and Kitaev, 2005
- Not checked yetcites Campbell et al. , 2017
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Fault-tolerant resource estimations have since been carried out for two main systems: small transition metal molecules, and condensed phase materials (including 2D Fermi-Hubbard models, 2D and 3D electron gases, and solid materials, such as lithium or diamond).”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“However, as described above, the figure of merit for fault-tolerant calculations is often the circuit depth - in particular the number of T or Toffoli gates.”
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It is difficult to prove that a given circuit will be able to obtain a good estimate for the ground state, especially when the difficulty of classical optimisation is considered.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✗ Checkable: fails✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. It may be too vague to check against evidence. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The VQE is a heuristic approach, which attempts to generate an approximation to the ground state wavefunction that is better than classical methods, using a short circuit.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Other works have conducted similar resource estimations for equivalently sized problems (100-200 spinorbitals), but have focused on matter in the condensed phase.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The first generations of quantum computers will be significantly smaller than this.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Wenote that those authors were considering a targeted majorana fermion-based quantum computer, with physical error rates 10 3 times lower than has been demonstrated in trapped ion or superconducting qubits, at our time of writing.”
What the sources say
- Not checked yetcites Reiher et al. , 2017
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“While an initial investigation into faulttolerant grid based simulation was performed (Jones et al. , 2012), it did not calculate the total number of T gates required, or the number of qubits, for systems of interest.”
What the sources say
- Not checked yetcites Jones et al. , 2012
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All resource estimates to date have focused on the 2D surface code, due to its high threshold, and suitability for architectures with a 2D nearest-neighbour connectivity.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In general, the longer the circuit is, the better it can approximate the ground state wavefunction.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Tubman et al. (2018) showed that the cost of this state preparation algorithm is considerably lower than the cost for phase estimation detailed above, and hence, may be neglected for many systems of interest.”
What the sources say
- Not checked yetcites Tubman et al. (2018)
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As discussed in Sec. V.B, the variational quantum eigensolver (VQE) has received significant attention in recent years, due to its short required circuit depth (compared to phase estimation).”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In the standard model of surface code resource estimation, Clifford gates (such as Pauli gates and the CNOT gate) are considered to be of negligible cost, while non-Clifford gates (such as the T gate, or Toffoli gate) are more costly.”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While the error mitigation techniques discussed in Sec. VI may enable us to recover accurate results from a circuit deeper than 10,000 gates, it seems unlikely that these methods alone would enable more than a small multiplicative increase in the circuit depth.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
In the paper
“Assuming the best physical error rates (10 -3 ) at our time of writing, this would require around 200 million physical qubits, and take on the order of weeks (10 ns to implement a T gate, including surface code decoding) or months (100 ns per T gate) (Reiher et al. , 2017).”
What the sources say
- Not checked yetcites Reiher et al. , 2017
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All of the resource estimation papers above focus on the cost of phase estimation, and assume that the system is prepared in an initial state that has a sufficiently large overlap with the true ground state.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“Moreover, there have been many improvements in fault-tolerant circuit design and magic state distillation since the work of Jones et al. (2012).”
What the sources say
- Not checked yetcites Jones et al. (2012)
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, the vast majority of these proposals: were tested on small system sizes, performed a limited number of comparisons to other techniques, and were not optimised for maximum efficacy.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“We can prepare initial states of the Fermi-Hubbard model using O ( M 1 . 5 ) gates, and perform Trotter steps of the Hamiltonian using O ( M ) gates for each Trotter step (Jiang et al. , 2018b).”
What the sources say
- Not checked yetcites Jiang et al. , 2018b
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In the realm of variational algorithms, a wide range of ans¨ atze, chemistry mappings, classical optimisation routines, and error mitigation techniques have been proposed in recent years.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, we have also shown that quantum methods still face many challenges, not least the high error rates and low qubit counts of existing hardware.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Ultimately, the success of quantum computational chemistry will depend on our ability to construct larger and better controlled quantum computers.”
Tests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This rough estimate neglects constant factors, and so the number of gates required would likely be higher.”
Strength:hedged· not yet calibratedCausal:conditional· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“This proposal has recently been formalised by McCaskey et al. (2019) and Nam et al. (2019).”
What the sources say
- Not checked yetcites McCaskey et al. (2019)
- Not checked yetcites Nam et al. (2019)
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Further work has shown promising results for both the ground state problem (Reiner et al. , 2018a), and dynamics simulation (Reiner et al. , 2018b), both in the presence of realistic noise rates.”
What the sources say
- Not checked yetcites Reiner et al. , 2018a
- Not checked yetcites Reiner et al. , 2018b
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We cannot expect to surpass classical methods without first reproducing classically known results.”
Tests✓ Asserted: passes✗ Checkable: fails✓ Load-bearing: passes✓ Based: passesProbably not a substantial claim. It may be too vague to check against evidence.
The paper relies on this without support.
Using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.
“It is believed that using quantum systems as our simulation platform will enable us to tackle classically intractable problems in chemistry, physics, and materials science.”
The paper relies on this without support.
Quantum computers will enable a more accurate understanding of the models in use today, as well as the ability to simulate more complex (and therefore, more realistic) models.
“As quantum computers are able to efficiently simulate quantum systems, it is believed that they will enable a more accurate understanding of the models in use today, as well as the ability to simulate more complex (and therefore, more realistic) models.”
The paper relies on this without support.
The electronic structure problem is a fundamental one in classical computational chemistry.
“Primarily, this problem is a fundamental one in classical computational chemistry.”
The paper relies on this without support.
Digital quantum simulation is more vulnerable to noise and device imperfections than analog simulation.
“Digital quantum simulation is more vulnerable to noise and device imperfections than analog simulation.”
The paper relies on this without support.
Many systems of commercial and scientific interest, such as catalysts and high temperature superconductors, are strongly correlated.
“Many systems of commercial and scientific interest, such as catalysts and high temperature superconductors, are believed to be strongly correlated.”
The paper relies on this without support.
High temperature superconductors are strongly correlated systems.
“High temperature superconductors are also believed to be strongly correlated systems.”
The paper relies on this without support.
Current quantum computers possess only tens of error-prone physical qubits.
“In contrast to the large error corrected machines described above, current quantum computers possess only tens of error-prone physical qubits.”
The authors state this as an assumption.
In order to isolate errors arising from the method used, the authors assume they are working in the full molecular orbital basis for the molecule.
“In order to isolate the errors arising from the method used, we assume that we are working in the full molecular orbital basis for our molecule, although in practice this would be classically intractable for large system sizes”
The authors state this as an assumption.
In the following section, the authors assume they include all possible determinants that a limited number of molecular orbitals can generate, unless explicitly stated.
“we consider only a limited number of molecular orbitals, but assume that we include all possible determinants that they can generate, unless explicitly stated.”
The paper relies on this without support.
Second quantised basis set methods are the most widely used approach in classical computational chemistry and have formed the basis of most work so far in quantum computational chemistry.
“Second quantised basis set methods are the most widely used approach in classical computational chemistry, and have formed the basis of most of the work done so far in quantum computational chemistry.”
The paper relies on this without support.
The second quantised grid based method has not yet been used in any classical or quantum computational chemistry algorithms.
“As discussed above, this second quantised grid based method has not yet (to the best of our knowledge) been used in any classical or quantum computational chemistry algorithms.”
The authors state this as an assumption.
Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices.
“Assuming fairly local interactions for a molecule, the degree of the graph will be less than the number of vertices.”
The paper relies on this without support.
For non-relativistic molecules, the total number of electrons and the total s_z value are conserved by the Hamiltonian.
“For non-relativistic molecules, the total number electrons and the total s z value are conserved.”
“As the electron number and total s z value are conserved by the Hamiltonian, these qubits are only acted on by the identity or Pauli Z operators.”
The paper relies on this without support.
It is classically intractable to store the required P^{3N} × 2^N = 2^{(3m+1)N} complex amplitudes for large quantum systems.
“While it is classically intractable to store the required P 3 N × 2 N = 2 (3 m +1) N complex amplitudes for large quantum systems, it is possible using a quantum computer.”
The paper relies on this without support.
Near-term quantum computers will not have enough physical qubits for error correction.
“As near-term quantum computers will not have enough physical qubits for error correction”
The authors state this as an assumption.
The methods discussed above require fault-tolerance.
“As a result, these methods are typically assumed to require fault-tolerance.”
The authors state this as an assumption.
A single Trotter step can be used to implement the UCC operator.
“These gate counts assume that a single Trotter step can be used to implement the UCC operator, which has previously been shown to yield accurate results (Barkoutsos et al. , 2018; Romero et al. , 2019).”
The authors state this as an assumption.
Low-lying excited states differ from the ground state by a small number of excitations.
“This is designed to target the low-lying excited states, which are assumed to differ from the ground state by a small number of excitations.”
The authors state this as an assumption.
The ansatz is composed of S layers.
“We assume that the ansatz is composed of S layers.”
The authors state this as an assumption.
The fourth orbital in the LiH NMO 1-RDM is never occupied.
“we assume that this orbital is never occupied”
The paper relies on this without support.
When the error rate is low, terms resulting from many errors are negligibly small.
“If the error rate is low, then the other terms can be considered negligibly small.”
The authors state this as an assumption.
The system is prepared in an initial state that has a sufficiently large overlap with the true ground state.
“All of the resource estimation papers above focus on the cost of phase estimation, and assume that the system is prepared in an initial state that has a sufficiently large overlap with the true ground state.”
The paper relies on this without support.
Current quantum computers possess only around 100 physical qubits, and a fully protected logical qubit has not yet been demonstrated.
“Current quantum computers possess only around 100 physical qubits, and we have yet to demonstrate a fully protected logical qubit.”
The paper relies on this without support.
The use of error correcting codes is complicated by the difficulty of producing error protected T gates.
“Nevertheless, the use of error correcting codes is complicated by the difficulty of producing error protected T gates.”
The paper relies on this without support.
Synthesizing an arbitrary angle rotation gate can require at least 10 to 100 T gates.
“Moreover, synthesizing an arbitrary angle rotation gate can require at least 10 to 100 T gates.”
The paper relies on this without support.
For many of the molecules in the G1 set, an FCI calculation on a sufficiently accurate basis set would be classically intractable.
“For many of the molecules in the G1 set, an FCI calculation on a sufficiently accurate basis set would be classically intractable (although they are typically not necessary due to highly accurate approximate methods and experimental results).”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Therefore, quantum computers can play a crucial role in performing precise simulations for chemical processes and procedures in biological sciences [9, 69-71].”
From Quantum Computing in the Next-Generation Computational Biology Landscape: From Protein Folding to Molecular Dynamics (2024) · cites this paper as [70]
The cited source says what the claim attributes to it.
In the citing paper
“The electronic structure problem is one of the most prominent tasks within VQAs (see for example the reviews (Cao et al. , 2019; McArdle et al. , 2020)) and was the pioneering task for VQE (McClean et al. , 2016; Peruzzo et al. , 2014).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as McArdle et al. , 2020
In the citing paper
“which are currently able to treat up to 50–70 single-particle states depending on the approach and on the features of the system [89]”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [89]
In the citing paper
“There is a certain consensus that quantum advantage will be realized only on a subset of electronic structure problems [86, 89, 90].”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [89]
In the citing paper
“These are strongly correlated/multireference systems that are not—and are not projected to be—at reach for classical algorithms”
From Quantum computing algorithms: getting closer to critical problems in computational biology (2022) · cites this paper as [89]
Citations
Cites
Dunning, T. H. (1989) · The Journal of Chemical Physics · doi:10.1063/1.456153 · Cited by 31,693
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,450
Ditchfield, R., Hehre, W. J., & Pople, J. A. (1971) · The Journal of Chemical Physics · doi:10.1063/1.1674902 · Cited by 10,612
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Electron correlations in narrow energy bands
Hubbard, J. (1963) · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · doi:10.1098/rspa.1963.0204 · Cited by 6,687
A full coupled-cluster singles and doubles model: The inclusion of disconnected triples
Purvis, G. D., & Bartlett, R. J. (1982) · The Journal of Chemical Physics · doi:10.1063/1.443164 · Cited by 6,523
Flagged first, then by citations
Research works printed but not linked: 12
- Berry, D. W., 2014, Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing (STOC ’14)
- Berry, D. W., 2015, Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, CA
- 10.5555/2481569.2481570 · DOI
- Coppersmith, D., 1994, IBM
- 10.5555/2685188.2685189 · DOI
- Malik, M. R., 2012, NASA
- 10.1103/physrevresearch.1.013129 · DOI
- 10.5555/2871401.2871402 · DOI
- Shor, P. W., 1994, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Sante Fe
- Shor, P. W., 1996, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT
- 10.5555/2600508.2600515 · DOI
- Yamada, S., 2005, Proceedings of the 2005 ACM/IEEE Conference on Supercomputing (SC ’05), Seattle
Cited by
Sorted by citations
Items 101–200 of 1,006
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
Cervera-Lierta, A., Kottmann, J. S., & Aspuru‐Guzik, A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020329 · Cited by 88
Self-citationA feasible approach for automatically differentiable unitary coupled-cluster on quantum computers
Kottmann, J. S., Anand, A., & Aspuru‐Guzik, A. (2021) · Chemical Science · doi:10.1039/d0sc06627c · Cited by 87
Self-citationReal-Time Evolution for Ultracompact Hamiltonian Eigenstates on Quantum Hardware
Klymko, K., Mejuto-Zaera, C., Cotton, S. J., Wudarski, F., Urbánek, M., Hait, D., Head‐Gordon, M., Whaley, K. B., Moussa, J. E., Wiebe, N., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020323 · Cited by 98
Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation
Gomes, N., Mukherjee, A., Zhang, F., Iadecola, T., Wang, C., Ho, K., Orth, P. P., & Yao, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100114 · Cited by 99
High-performance superconducting quantum processors via laser annealing of transmon qubits
Zhang, E., Srinivasan, S. J., Sundaresan, N., Bogorin, D. F., Martin, Y., Hertzberg, J., Timmerwilke, J., Pritchett, E., Yau, J.-B., Wang, C., et al. (2022) · Science Advances · doi:10.1126/sciadv.abi6690 · Cited by 127
Fermionic quantum processing with programmable neutral atom arrays
González-Cuadra, D., Bluvstein, D., Kalinowski, M., Kaubruegger, R., Maskara, N., Naldesi, P., Zache, T. V., Kaufman, A. M., Lukin, M. D., Pichler, H., et al. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2304294120 · Cited by 104
Yalouz, S., Senjean, B., Günther, J., Buda, F., O’Brien, T. E., & Visscher, L. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abd334 · Cited by 88
Evaluating the noise resilience of variational quantum algorithms
Fontana, E., Fitzpatrick, N., Ramo, D. M., Duncan, R., & Rungger, I. (2021) · Physical Review A · doi:10.1103/physreva.104.022403 · Cited by 99
Early fault-tolerant simulations of the Hubbard model
Campbell, E. T. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3110 · Cited by 81
Measurement-Based Variational Quantum Eigensolver
Ferguson, R. R., Dellantonio, L., Balushi, A. A., Jansen, K., Dür, W., & Muschik, C. A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.220501 · Cited by 87
Bokhan, D., Mastiukova, A. S., Boev, A. S., Trubnikov, D. N., & Fedorov, A. K. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.1069985 · Cited by 89
Ennafaa, F., Chraka, A., Tassaoui, K., Mouamr, I., Damej, M., Mahmoudi, A. E., Bougrin, K., Rahal, H. T., & Benmessaoud, M. (2025) · Materials Chemistry and Physics · doi:10.1016/j.matchemphys.2025.130441 · Cited by 81
Gujju, Y., Matsuo, A., & Raymond, R. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.067001 · Cited by 104
Quantum Simulation with Hybrid Tensor Networks
Yuan, X., Sun, J., Liu, J., Zhao, Q., & Zhou, Y. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.040501 · Cited by 93
Self-citationSimulating quantum materials with digital quantum computers
Oftelie, L. B., Urbánek, M., Metcalf, M., Carter, J. T., Kemper, A. F., & de Jong, W. A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac1ca6 · Cited by 83
Resource Estimation for Quantum Variational Simulations of the Hubbard Model
Cai, Z. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014059 · Cited by 78
Metcalf, M., Bauman, N. P., Kowalski, K., & de Jong, W. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00421 · Cited by 79
Generalized Quantum Subspace Expansion
Yoshioka, N., Hakoshima, H., Matsuzaki, Y., Tokunaga, Y., Suzuki, Y., & Endo, S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.020502 · Cited by 87
Self-citationIzmaylov, A. F., Yen, T.-C., & Ryabinkin, I. G. (2019) · Chemical Science · doi:10.1039/c8sc05592k · Cited by 78
Chamberland, C., & Noh, K. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00319-5 · Cited by 97
Efficient Step-Merged Quantum Imaginary Time Evolution Algorithm for Quantum Chemistry
Gomes, N., Zhang, F., Berthusen, N., Wang, C., Ho, K., Orth, P. P., & Yao, Y. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00666 · Cited by 72
Quantum computing of fluid dynamics using the hydrodynamic Schrödinger equation
Meng, Z., & Yang, Y. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033182 · Cited by 90
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13623 · Cited by 196
Observation of separated dynamics of charge and spin in the Fermi-Hubbard modelPreprint
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Bengtsson, A., Boixo, S., Broughton, M., Buckley, B. B., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.07965 · Cited by 201
Self-citationEfficient evaluation of quantum observables using entangled measurements
Hamamura, I., & Imamichi, T. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0284-2 · Cited by 80
Improving Hamiltonian encodings with the Gray code
Matteo, O. D., McCoy, A. E., Gysbers, P., Miyagi, T., Woloshyn, R. M., & Navrátil, P. (2021) · Physical Review A · doi:10.1103/physreva.103.042405 · Cited by 77
Quantum computation of dominant products in lithium–sulfur batteries
Rice, J. E., Gujarati, T. P., Motta, M., Takeshita, T. Y., Lee, E., Latone, J. A., & Garcia, J. M. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0044068 · Cited by 85
Variational quantum eigensolver with reduced circuit complexity
Zhang, Y., Cincio, Ł., Negre, C. F. A., Czarnik, P., Coles, P. J., Anisimov, P. M., Mniszewski, S. M., Tretiak, S., & Dub, P. A. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00599-z · Cited by 88
Tkachenko, N. V., Sud, J., Zhang, Y., Tretiak, S., Anisimov, P. M., Arrasmith, A. T., Coles, P. J., Cincio, L., & Dub, P. A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020337 · Cited by 73
Bharti, K., & Haug, T. (2021) · Physical Review A · doi:10.1103/physreva.104.042418 · Cited by 79
Classically optimized Hamiltonian simulation
Keever, C. M., & Lubasch, M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023146 · Cited by 92
Synergistic pretraining of parametrized quantum circuits via tensor networks
Rudolph, M. S., Miller, J., Motlagh, D., Chen, J., Acharya, A., & Perdomo‐Ortiz, A. (2023) · Nature Communications · doi:10.1038/s41467-023-43908-6 · Cited by 118
Universal quantum circuits for quantum chemistry
Arrazola, J. M., Matteo, O. D., Quesada, N., Jahangiri, S., Delgado, A., & Killoran, N. (2022) · Quantum · doi:10.22331/q-2022-06-20-742 · Cited by 87
Cao, C., Hu, J., Zhang, W., Xu, X., Chen, D., Yu, F., Li, J., Hu, H., Lv, D., & Yung, M. (2022) · Physical Review A · doi:10.1103/physreva.105.062452 · Cited by 84
Experimental quantum computational chemistry with optimized unitary coupled cluster ansatz
Guo, S., Sun, J., Qian, H., Gong, M., Zhang, Y., Chen, F., Ye, Y., Wu, Y., Cao, S., Liu, K., et al. (2024) · Nature Physics · doi:10.1038/s41567-024-02530-z · Cited by 95
Self-citationQuantum software testing: State of the art
de la Barrera, A. G., de Guzmán, I. G., Polo, M., & Piattini, M. G. (2021) · Journal of Software Evolution and Process · doi:10.1002/smr.2419 · Cited by 85
TEQUILA: a platform for rapid development of quantum algorithms
Kottmann, J. S., Alperin-Lea, S., Tamayo-Mendoza, T., Cervera-Lierta, A., Lavigne, C., Yen, T.-C., Verteletskyi, V., Schleich, P., Anand, A., Degroote, M., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe567 · Cited by 85
Self-citationDirect observation of geometric-phase interference in dynamics around a conical intersection
Valahu, C. H., Olaya-Agudelo, V. C., MacDonell, R. J., Navickas, T., Rao, A. D., Millican, M. J., Pérez-Sánchez, J. B., Yuen-Zhou, J. Y., Biercuk, M. J., Hempel, C., et al. (2023) · Nature Chemistry · doi:10.1038/s41557-023-01300-3 · Cited by 82
Evaluating the job shop scheduling problem on a D-wave quantum annealer
Carugno, C., Dacrema, M. F., & Cremonesi, P. (2022) · Scientific Reports · doi:10.1038/s41598-022-10169-0 · Cited by 73
Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
Heurtel, N., Fyrillas, A., de Gliniasty, G., Bihan, R. L., Malherbe, S., Pailhas, M., Bertasi, E., Bourdoncle, B., Emeriau, P.-E., Mezher, R., et al. (2023) · Quantum · doi:10.22331/q-2023-02-21-931 · Cited by 94
Barren plateaus in quantum tensor network optimization
Cervero-Martín, E., Plekhanov, K., & Lubasch, M. (2023) · Quantum · doi:10.22331/q-2023-04-13-974 · Cited by 83
Concentration for Random Product Formulas
Chen, C.-F., Huang, H.-Y., Kueng, R., & Tropp, J. A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040305 · Cited by 94
Speed limits and locality in many-body quantum dynamics
Chen, C.-F., Lucas, A., & Yin, C. (2023) · Reports on Progress in Physics · doi:10.1088/1361-6633/acfaae · Cited by 104
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2020) · arXiv · doi:10.48550/arxiv.2007.10917 · Cited by 66
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010346 · Cited by 83
Representation Learning via Quantum Neural Tangent Kernels
Liu, J., Tacchino, F., Glick, J. R., Jiang, L., & Mezzacapo, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030323 · Cited by 81
Exact and efficient Lanczos method on a quantum computer
Kirby, W., Motta, M., & Mezzacapo, A. (2023) · Quantum · doi:10.22331/q-2023-05-23-1018 · Cited by 81
Penalty methods for a variational quantum eigensolver
Kuroiwa, K., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013197 · Cited by 76
Experimental Quantum State Measurement with Classical Shadows
Zhang, T., Sun, J., Fang, X.-X., Zhang, X.-M., Yuan, X., & Lu, H. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200501 · Cited by 73
Self-citationTEQUILA: a platform for rapid development of quantum algorithms
Kottmann, J. S., Alperin-Lea, S., Chaney, S., Kesibi, M., Curnow, N. G., Solo, B., Tsilimigkounakis, G., Zendejas-Morales, C., Izmaylov, A. F., Aspuru‐Guzik, A., et al. (2021) · RWTH Publications (RWTH Aachen) · Cited by 68
Self-citationVariational approaches to constructing the many-body nuclear ground state for quantum computing
Stetcu, I., Baroni, A., & Carlson, J. (2022) · Physical Review C · doi:10.1103/physrevc.105.064308 · Cited by 79
Solving nuclear structure problems with the adaptive variational quantum algorithm
Romero, A. M., Engel, J., Tang, H. L., & Economou, S. E. (2022) · Physical Review C · doi:10.1103/physrevc.105.064317 · Cited by 75
Quantum embedding theories to simulate condensed systems on quantum computers
Vorwerk, C., Sheng, N., Govoni, M., Huang, B., & Galli, G. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00279-0 · Cited by 73
Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
Chen, M.-C., Gong, M., Xu, X., Yuan, X., Wang, J., Wang, C., Ying, C., Lin, J., Xu, Y., Wu, Y., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.180501 · Cited by 68
Self-citationTowards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Li, W., Huang, Z., Cao, C., Huang, Y., Shuai, Z., Sun, X., Sun, J., Yuan, X., & Lv, D. (2022) · Chemical Science · doi:10.1039/d2sc01492k · Cited by 68
Self-citationOptimal resource cost for error mitigation
Takagi, R. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033178 · Cited by 73
TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze
Anastasiou, P. G., Chen, Y., Mayhall, N. J., Barnes, E., & Economou, S. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013254 · Cited by 92
Nearly tight Trotterization of interacting electrons
Su, Y., Huang, H.-Y., & Campbell, E. T. (2021) · Quantum · doi:10.22331/q-2021-07-05-495 · Cited by 79
Quantum computational quantification of protein–ligand interactions
Kirsopp, J. J. M., Di Paola, C., Manrique, D. Z., Krompiec, M., Greene‐Diniz, G., Guba, W., Meyder, A., Wolf, D., Strahm, M., & Muñoz Ramo, D. (2022) · International Journal of Quantum Chemistry · doi:10.1002/qua.26975 · Cited by 59
RetractedQuantum simulation of the Lindblad equation using a unitary decomposition of operators
Schlimgen, A. W., Head-Marsden, K., Sager-Smith, L. M., Narang, P., & Mazziotti, D. A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023216 · Cited by 60
Asthana, A., Kumar, A., Abraham, V., Grimsley, H. R., Zhang, Y., Cincio, Ł., Tretiak, S., Dub, P. A., Economou, S. E., Barnes, E., et al. (2023) · Chemical Science · doi:10.1039/d2sc05371c · Cited by 65
Unleashing the power of disruptive and emerging technologies amid COVID-19: A detailed reviewPreprint
Agarwal, S., Punn, N. S., Sonbhadra, S. K., Tanveer, M., Nagabhushan, P., Pandian, K. K. S., & Saxena, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.11507 · Cited by 93
Neural Error Mitigation of Near-Term Quantum Simulations
Bennewitz, E. R., Hopfmueller, F., Kulchytskyy, B., Carrasquilla, J., & Ronagh, P. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00509-0 · Cited by 73
A semi-agnostic ansatz with variable structure for variational quantum algorithms
Bilkis, M., Cerezo, M., Verdon, G., Coles, P. J., & Cincio, Ł. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00132-1 · Cited by 98
Universal Sampling Lower Bounds for Quantum Error Mitigation
Takagi, R., Tajima, H., & Gu, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.210602 · Cited by 85
Hybrid quantum-classical machine learning for generative chemistry and drug design
Gircha, A. I., Boev, A. S., Avchaciov, K., Fedichev, P. O., & Fedorov, A. K. (2023) · Scientific Reports · doi:10.1038/s41598-023-32703-4 · Cited by 82
Variational Quantum-Neural Hybrid Eigensolver
Zhang, S., Wan, Z., Lee, C., Hsieh, C., Zhang, S., & Yao, H. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120502 · Cited by 65
Feniou, C., Hassan, M., Traoré, D., Giner, E., Maday, Y., & Piquemal, J. (2023) · Communications Physics · doi:10.1038/s42005-023-01312-y · Cited by 74
Wang, L., Zhang, Y., Zou, R., Yuan, Y., Zou, R., Huang, L., Liu, Y., Ding, J.-C., & Meng, Z. (2024) · Petroleum Science · doi:10.1016/j.petsci.2024.09.023 · Cited by 56
Symmetry-Assisted Preparation of Entangled Many-Body States on a Quantum Computer
Denis Lacroix, A. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.230502 · Cited by 60
Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
Delgado, A., Casares, P. A. M., dos Reis, R., Zini, M. S., Campos, R., Hernández, N. C., Voigt, A.-C., Lowe, A., Jahangiri, S., Martin-Delgado, M. A., et al. (2022) · Physical Review A · doi:10.1103/physreva.106.032428 · Cited by 71
Exact electronic states with shallow quantum circuits from global optimisation
Burton, H. G. A., Marti-Dafcik, D., Tew, D. P., & Wales, D. J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00744-2 · Cited by 69
Integrating quantum computing resources into scientific HPC ecosystems
Beck, T. L., Baroni, A., Bennink, R. S., Buchs, G., Pérez, E. A. C., Eisenbach, M., da Silva, R. F., Meena, M. G., Gottiparthi, K., Groszkowski, P., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.058 · Cited by 82
Variational quantum algorithm for nonequilibrium steady states
Yoshioka, N., Nakagawa, Y. O., Mitarai, K., & Fujii, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043289 · Cited by 54
Radnaev, A. G., Chung, W. C., Cole, D. C., Mason, D., Ballance, T. G., Bedalov, M. J., Belknap, D. A., Berman, M. R., Blakely, M., Bloomfield, I. L., et al. (2025) · PRX Quantum · doi:10.1103/66s8-jj18 · Cited by 54
Quantum simulation of quantum field theories as quantum chemistry
Liu, J., & Xin, Y. (2020) · Journal of High Energy Physics · doi:10.1007/jhep12(2020)011 · Cited by 54
Izmaylov, A. F., Lang, R. A., & Yen, T.-C. (2021) · Physical Review A · doi:10.1103/physreva.104.062443 · Cited by 65
Overlapped grouping measurement: A unified framework for measuring quantum states
Wu, B., Sun, J., Huang, Q. J., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-01-13-896 · Cited by 71
Self-citationEfficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation
Martyn, J. M., Liu, Y., Chin, Z. E., & Chuang, I. L. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0124385 · Cited by 65
Motta, M., Sung, K. J., Whaley, K. B., Head‐Gordon, M., & Shee, J. (2023) · Chemical Science · doi:10.1039/d3sc02516k · Cited by 74
Artificial intelligence (AI) in drug design and discovery: A comprehensive review
Bhat, A. R., & Ahmed, S. (2025) · In Silico Research in Biomedicine · doi:10.1016/j.insi.2025.100049 · Cited by 68
Correlating AGP on a quantum computer
Khamoshi, A., Evangelista, F. A., & Scuseria, G. E. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abc1bb · Cited by 59
Iterative quantum-assisted eigensolver
Bharti, K., & Haug, T. (2021) · Physical Review A · doi:10.1103/physreva.104.l050401 · Cited by 64
Application of Quantum Computing to Biochemical Systems: A Look to the Future
Cheng, H.-P., Deumens, E., Freericks, J. K., Li, C., & Sanders, B. A. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.587143 · Cited by 53
Guimarães, J. D., Lim, J., Vasilevskiy, M. I., Huelga, S. F., & Plenio, M. B. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040329 · Cited by 63
Robust quantum compilation and circuit optimisation via energy minimisation
Jones, T., & Benjamin, S. C. (2022) · Quantum · doi:10.22331/q-2022-01-24-628 · Cited by 84
Self-citationQuantum Computing: An Overview Across the System StackPreprint
Resch, S., & Karpuzcu, U. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07240 · Cited by 94
Data used in "Qubit Readout Error Mitigation with Bit-flip Averaging"
Smith, A. W. R., Self, C. N., Khosla, K. E., & Kim, M. S. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.5267396 · Cited by 76
Mutual information-assisted adaptive variational quantum eigensolver
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca4 · Cited by 52
Self-citationMeasurement Cost of Metric-Aware Variational Quantum Algorithms
van Straaten, B., & Koczor, B. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030324 · Cited by 55
Benchmarking Adaptive Variational Quantum Eigensolvers
Claudino, D., Wright, J., McCaskey, A. J., & Humble, T. S. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.606863 · Cited by 52
Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals
Liu, J., Wan, L., Li, Z., & Yang, J. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00881 · Cited by 54
Davoudi, Z., Shaw, A. F., & Stryker, J. R. (2023) · Quantum · doi:10.22331/q-2023-12-20-1213 · Cited by 92
Overhead for simulating a non-local channel with local channels by quasiprobability sampling
Mitarai, K., & Fujii, K. (2021) · Quantum · doi:10.22331/q-2021-01-28-388 · Cited by 67
The MQT Handbook : A Summary of Design Automation Tools and Software for Quantum Computing
Wille, R., Berent, L., Forster, T., Kunasaikaran, J., Mato, K., Peham, T., Quetschlich, N., Rovara, D., Sander, A., Schmid, L., et al. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00013 · Cited by 54
The dominant eigenvector of a noisy quantum state
Koczor, B. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac37ae · Cited by 52
Calculating transition amplitudes by variational quantum deflation
Ibe, Y., Nakagawa, Y. O., Earnest, N., Yamamoto, T., Mitarai, K., Gao, Q., & Kobayashi, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013173 · Cited by 61
Advancing hybrid quantum–classical computation with real-time execution
Lubinski, T., Granade, C., Anderson, A., Geller, A., Roetteler, M., Petrenko, A., & Heim, B. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.940293 · Cited by 63
Metadata
- Authors
- McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X.
- Affiliations
- University of Oxford (GB)
- Venue
- Reviews of Modern Physics
- Publisher
- American Physical Society (APS)
- Published
- 2020-03-30
- Volume
- 92
- Issue
- 1
- ISSN
- 0034-6861 (ISSN-L)
- 1539-0756
- OpenAlex
- W2889126882
- Semantic Scholar
- b49ca782a7c16ca66345ccc8c73beabb6bf2ce92
- Cited by
- 1,621
- References
- 415
- Citations by year
- 2026: 197 · 2025: 316 · 2024: 305 · 2023: 273 · 2022: 216 · 2021: 212 · 2020: 84
- FWCI
- 77.29
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Reviews of Modern Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Engineering and Physical Sciences Research Council (EP/M013243/1)
- U.S. Department of Defense
- Japan Student Services Organization
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- quantum algorithms, quantum chemistry, quantum computing, algorithm design, scalability, transition metal catalysis, biochemical reactions, quantum simulation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review