English
Related papers

Related papers: Improving quantum measurements by introducing "gho…

200 papers

Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. In this paper, we propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator components of…

Quantum Physics · Physics 2023-10-16 Youle Wang , Guangxi Li , Xin Wang

Direct fidelity estimation is a protocol that estimates the fidelity between an experimental quantum state and a target pure state. By measuring the expectation values of Pauli operators selected through importance sampling, the method is…

Quantum Physics · Physics 2025-07-09 Júlia Barberà-Rodríguez , Mariana Navarro , Leonardo Zambrano

In the current noisy intermediate scale quantum era of quantum computation, available hardware is severely limited by both qubit count and noise levels, precluding the application of many current hybrid quantum-classical algorithms to…

Quantum Physics · Physics 2024-03-05 Maria-Andreea Filip

Variational algorithms have received significant attention in recent years due to their potential to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. A fundamental step of these algorithms is the evaluation of…

Estimating observable expectation values in eigenstates of quantum systems has a broad range of applications and is an area where early fault-tolerant quantum computers may provide practical quantum advantage. We develop a hybrid…

Quantum Physics · Physics 2026-03-03 Bence Bakó , Tenzan Araki , Bálint Koczor

Estimation of physical observables for unknown quantum states is an important problem that underlies a wide range of fields, including quantum information processing, quantum physics, and quantum chemistry. In the context of quantum…

Quantum Physics · Physics 2024-05-21 Yuma Nakamura , Yoshichika Yano , Nobuyuki Yoshioka

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the…

Quantum Physics · Physics 2020-08-26 William J. Huggins , Joonho Lee , Unpil Baek , Bryan O'Gorman , K. Birgitta Whaley

Variational quantum algorithms are promising applications of noisy intermediate-scale quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and-measure experiments that estimate terms in a Hamiltonian. The…

Quantum Physics · Physics 2020-06-25 Andrew Zhao , Andrew Tranter , William M. Kirby , Shu Fay Ung , Akimasa Miyake , Peter Love

We consider the problem of estimating quantum observables on a collection of qubits, given as a linear combination of Pauli operators, with shallow quantum circuits consisting of single-qubit rotations. We introduce estimators based on…

Quantum Physics · Physics 2022-08-08 Stefan Hillmich , Charles Hadfield , Rudy Raymond , Antonio Mezzacapo , Robert Wille

Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable…

Quantum Physics · Physics 2023-01-26 Pavithran Iyer , Aditya Jain , Stephen D. Bartlett , Joseph Emerson

The transformation of a molecular Hamiltonian from the fermionic space to the qubit space results in a series of Pauli strings. Calculating the energy then involves evaluating the expectation values of each of these strings, which presents…

Quantum Physics · Physics 2025-03-25 Harshdeep Singh , Sonjoy Majumder , Sabyashachi Mishra

Observable estimation is a core primitive in NISQ-era algorithms targeting quantum chemistry applications. To reduce the state preparation overhead required for accurate estimation, recent works have proposed various simultaneous…

Quantum Physics · Physics 2024-11-12 Matthew X. Burns , Chenxu Liu , Samuel Stein , Bo Peng , Karol Kowalski , Ang Li

We study classical shadows protocols based on randomized measurements in $n$-qubit entangled bases, generalizing the random Pauli measurement protocol ($n = 1$). We show that entangled measurements ($n\geq 2$) enable nontrivial and…

Quantum Physics · Physics 2024-03-27 Matteo Ippoliti

Extracting information efficiently from quantum systems is a major component of quantum information processing tasks. Randomized measurements, or classical shadows, enable predicting many properties of arbitrary quantum states using few…

Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…

Quantum Physics · Physics 2025-02-07 Yifan Zhang , Yuxuan Zhang

We revisit the problem of Pauli shadow tomography: given copies of an unknown $n$-qubit quantum state $\rho$, estimate $\text{tr}(P\rho)$ for some set of Pauli operators $P$ to within additive error $\epsilon$. This has been a popular…

Quantum Physics · Physics 2024-11-18 Sitan Chen , Weiyuan Gong , Qi Ye

The advent of cloud quantum computing has led to the rapid development of quantum algorithms. In particular, it is necessary to study variational quantum-classical hybrid algorithms, which are executable on noisy intermediate-scale quantum…

Quantum Physics · Physics 2020-07-02 Ikko Hamamura , Takashi Imamichi

Sequential weak measurements of non-commuting observables is not only fundamentally interesting in quantum measurement but also shown potential in various applications. The previous reported methods, however, can only realize limited…

The number of measurements demanded by hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) is prohibitively high for many problems of practical value. For such problems, realizing quantum advantage will…

Quantum Physics · Physics 2021-03-24 Guoming Wang , Dax Enshan Koh , Peter D. Johnson , Yudong Cao

Efficiently estimating energy expectation values of quantum lattice systems on quantum computers is a crucial subroutine for various quantum algorithms, which can lead to significant overhead due to the high measurement shot numbers…