Fermionic Partial Tomography via Classical Shadows
TL;DR: This work proves that estimating all k-RDM elements to additive precision ϵ requires on the order of (n/k)k^{3/2}log(n)/ϵ^{2} repeated state preparations, which is optimal up to the logarithmic factor.
read more
Abstract: We propose a tomographic protocol for estimating any $k$-body reduced density matrix ($k$-RDM) of an $n$-mode fermionic state, a ubiquitous step in near-term quantum algorithms for simulating many-body physics, chemistry, and materials. Our approach extends the framework of classical shadows, a randomized approach to learning a collection of quantum-state properties, to the fermionic setting. Our sampling protocol uses randomized measurement settings generated by a discrete group of fermionic Gaussian unitaries, implementable with linear-depth circuits. We prove that estimating all $k$-RDM elements to additive precision $ϵ$ requires on the order of $(\genfrac{}{}{0ex}{}{n}{k}){k}^{3/2}\mathrm{log}(n)/{ϵ}^{2}$ repeated state preparations, which is optimal up to the logarithmic factor. Furthermore, numerical calculations show that our protocol offers a substantial improvement in constant overheads for $k\ensuremath{\ge}2$, as compared to prior deterministic strategies. We also adapt our method to particle-number symmetry, wherein the additional circuit depth may be halved at the cost of roughly 2--5 times more repetitions.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
The Variational Quantum Eigensolver: a review of methods and best practices
Jules Tilly,Hongxiang Chen,Shuxiang Cao,Dario Picozzi,Kanav Setia,Ying Li,Edward R. Grant,Leonard Wossnig,Ivan Rungger,George H. Booth,Jonathan Tennyson +10 more
TL;DR: The variational quantum eigensolver (or VQE) as mentioned in this paper uses the variational principle to compute the ground state energy of a Hamiltonian, a problem that is central to quantum chemistry and condensed matter physics.
501
The randomized measurement toolbox
Andreas Elben,Steven T. Flammia,Hsin-Yuan Huang,Richard Kueng,John Preskill,Benoît Vermersch,Peter Zoller +6 more
TL;DR: In this article , the authors present protocols for probing the properties of complex many-qubit systems using measurement schemes that are practical using today's quantum platforms, such as programmable quantum simulators and quantum computers.
272
Provably efficient machine learning for quantum many-body problems
TL;DR: In this article , the authors prove that classical machine learning algorithms can efficiently predict ground-state properties of gapped Hamiltonians after learning from other Hamiltonians in the same quantum phase of matter.
•Posted Content
Provably efficient machine learning for quantum many-body problems.
TL;DR: It is proved that classical ML algorithms can efficiently predict ground state properties of gapped Hamiltonian in finite spatial dimensions, after learning from data obtained by measuring other Hamiltonians in the same quantum phase of matter.
103
Measurements as a roadblock to near-term practical quantum advantage in chemistry: Resource analysis
26 Aug 2022
TL;DR: In this article , the number of qubits and number of measurements required to compute the combustion energies of small organic molecules and related systems to within chemical accuracy of experimental values using VQE were investigated.
References
•Book
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum Computation and Quantum Information
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Dec 2010
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
19.6K
Quantum computation and quantum information
TL;DR: This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing, with a focus on entanglement.
15.9K
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Related Papers (5)
[...]