• Corpus ID: 207797626

Quantum simulation by qubitization without Toffoli gates

@inproceedings{Steudtner2019QuantumSB,
  title={Quantum simulation by qubitization without Toffoli gates},
  author={Mark Steudtner and Stephanie Wehner},
  year={2019}
}
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires additional qubits to store information about the Hamiltonian, and Toffoli gates to probe them throughout the routine. Recently, it was shown that storing the Hamitlonian in a unary representation can alleviate the need for such gates in one of the qubitization… 

Figures from this paper

References

SHOWING 1-10 OF 35 REFERENCES
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
TLDR
Compiling to surface code fault-tolerant gates and assuming per gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods.
Quantum Algorithm for Spectral Measurement with a Lower Gate Count.
TLDR
Two techniques are presented that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations, and a unitary operator is proposed which can be implemented exactly, circumventing any Taylor or Trotter approximation errors.
Hamiltonian Simulation by Qubitization.
TLDR
The Hamiltonian is presented, where the Hamiltonian of a unit is the cause of error and the time-evolution operator is approximate.
Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
Many applications of quantum simulation require to prepare and then characterize quantum states by performing an efficient partial tomography to estimate observables corresponding to $k$-body reduced
Unitary partitioning approach to the measurement problem in the Variational Quantum Eigensolver method.
TLDR
A circuit formulation of the VQE algorithm is found that allows one to measure a group of fully anti-commuting terms of the Hamiltonian in a single series of single-qubit measurements, consistent with an $N-fold reduction in the number of measurable groups.
Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians
Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
TLDR
This work presents a measurement strategy based on a low-rank factorization of the two-electron integral tensor that provides a cubic reduction in term groupings over prior state-of-the-art and enables measurement times three orders of magnitude smaller than those suggested by commonly referenced bounds for the largest systems.
Faster quantum simulation
  • by randomization. Quantum,
  • 2019
Faster quantum simulation by randomization
TLDR
By simply randomizing how the summands are ordered, one can prove stronger bounds on the quality of approximation for product formulas of any given order, and thereby give more efficient simulations of Hamiltonian dynamics.
Faster quantum simulation by randomization. Quantum
  • 2019
...
1
2
3
4
...