# Nearly Optimal Quantum Algorithm for Generating the Ground State of a Free Quantum Field Theory

@article{Bagherimehrab2022NearlyOQ,
title={Nearly Optimal Quantum Algorithm for Generating the Ground State of a Free Quantum Field Theory},
author={Mohsen Bagherimehrab and Yuval R. Sanders and Dominic W. Berry and Gavin K. Brennen and Barry C. Sanders},
journal={PRX Quantum},
year={2022}
}
• Published 12 October 2021
• Computer Science, Physics
• PRX Quantum
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms -- Fourier-based and wavelet-based -- to generate the ground state of a…
2 Citations

## Figures and Tables from this paper

### Entanglement in quantum field theory via wavelet representations

• Physics
Physical Review D
• 2022
Quantum ﬁeld theory (QFT) describes nature using continuous ﬁelds, but physical properties of QFT are usually revealed in terms of measurements of observables at a ﬁnite resolution. We describe a

### Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm

• Computer Science, Physics
IEEE Transactions on Quantum Engineering
• 2022
This work characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm that one may wish to run on a given NISQ device.

## References

SHOWING 1-10 OF 26 REFERENCES

### Quantum circuit for the fast Fourier transform

• Computer Science, Physics
Quantum Inf. Process.
• 2020
An implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates, which is effectively implemented as effectively as possible and does not generate any garbage bits.

### Ramanujan's Notebooks

During the time period between 1903 and 1914, Ramanujan worked in almost complete isolation in India. Throughout these years, he recorded his mathematical results without proofs in notebooks. Upon

### On a matrix algebra related to the discrete Hartley transform

• Computer Science, Mathematics
• 1993
It is proved that all the matrices of $\mathcal{H}$ can be simultaneously diagonalized by the similarity transformation associated to the discrete Hartley transform.

### On the representation of operators in bases of compactly supported wavelets

This paper describes exact and explicit representations of the differential operators, ${{d^n } / {dx^n }}$, $n = 1,2, \cdots$, in orthonormal bases of compactly supported wavelets as well as the

### Conventions for quantum pseudocode

A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a