Towards a variational Jordan–Lee–Preskill quantum algorithm
Machine Learning: Science and Technology IOP Publishing 3:4 (2022) 045030-045030
Abstract:
Abstract Rapid developments of quantum information technology show promising opportunities for simulating quantum field theory in near-term quantum devices. In this work, we formulate the theory of (time-dependent) variational quantum simulation of the 1 + 1 dimensional λ ϕ 4 quantum field theory including encoding, state preparation, and time evolution, with several numerical simulation results. These algorithms could be understood as near-term variational quantum circuit (quantum neural network) analogs of the Jordan–Lee–Preskill algorithm, the basic algorithm for simulating quantum field theory using universal quantum devices. Besides, we highlight the advantages of encoding with harmonic oscillator basis based on the Lehmann—Symanzik—Zimmermann reduction formula and several computational efficiency such as when implementing a bosonic version of the unitary coupled cluster ansatz to prepare initial states. We also discuss how to circumvent the ‘spectral crowding’ problem in the quantum field theory simulation and appraise our algorithm by both state and subspace fidelities.Perturbative quantum simulation
Physical Review Letters American Physical Society 129:12 (2022) 120505
Abstract:
Approximation based on perturbation theory is the foundation for most of the quantitative predictions of quantum mechanics, whether in quantum many-body physics, chemistry, quantum field theory, or other domains. Quantum computing provides an alternative to the perturbation paradigm, yet state-of-the-art quantum processors with tens of noisy qubits are of limited practical utility. Here, we introduce perturbative quantum simulation, which combines the complementary strengths of the two approaches, enabling the solution of large practical quantum problems using limited noisy intermediate-scale quantum hardware. The use of a quantum processor eliminates the need to identify a solvable unperturbed Hamiltonian, while the introduction of perturbative coupling permits the quantum processor to simulate systems larger than the available number of physical qubits. We present an explicit perturbative expansion that mimics the Dyson series expansion and involves only local unitary operations, and show its optimality over other expansions under certain conditions. We numerically benchmark the method for interacting bosons, fermions, and quantum spins in different topologies, and study different physical phenomena, such as information propagation, charge-spin separation, and magnetism, on systems of up to 48 qubits only using an 8+1 qubit quantum hardware. We demonstrate our scheme on the IBM quantum cloud, verifying its noise robustness and illustrating its potential for benchmarking large quantum processors with smaller ones.Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity
ArXiv 2203.11112 (2022)
Experimental Quantum State Measurement with Classical Shadows
Physical Review Letters American Physical Society (APS) 127:20 (2021) 200501
Universal quantum algorithmic cooling on a quantum computer
ArXiv 2109.15304 (2021)