Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1901.00015 · Physical Review Research

Methodology for replacing indirect measurements with direct measurements

Kosuke Mitarai, Keisuke Fujii

Published Aug 9, 2019• 138 citations
arXivHTMLPDF

Abstract

This work investigates the mechanism by which indirect measurements can be replaced by direct ones in quantum algorithms. The authors propose a protocol to simplify the measurement of correlators in the quantum simulation and derivatives with respect to the parameters in the variational algorithms, by reducing the required number of gates.

DOI
10.1103/physrevresearch.1.013006

Related papers

Theory of Quantum Mechanical Measurements

Günther Ludwig

No measurement is possible without any theory. With respect to a theory under consideration one has to distinguish between direct and indirect measurements. Direct measurements are defined by pre-theories, i.e. without the theory under consideration. The direct measurements for quantum theory are given by measurable processes on macroscopic devices. It is demonstrated how indirect measurements in quantum mechanics can be reduced to direct measurements. A theory of the measuring device is in this context not possible by quantum mechanics alone, but by a more comprehensive theory of macrosystems.

Metrologia•Jan 1, 1986•9 citations

Variational quantum algorithms with significantly fewer measurements

Ryan Babbush, Jarrod R. McClean, Nan Ding +3 more

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Simulating Many-Body Systems with a Projective Quantum Eigensolver

Nicholas H. Stair, Francesco A. Evangelista

A reformulation of a variational quantum algorithm enables investigation of strongly correlated electronic systems with one to two orders of magnitude fewer quantum measurements than the state-of-the-art.

arXiv:2102.00345•PRX Quantum•Jul 1, 2021•60 citations

Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States

Xavier Bonet-Monroig, Babbush, R., O’Brien, T.E.

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 density matrices ($k$-RDMs). For instance, variational algorithms for the quantum simulation of chemistry usually require that one measure the fermionic 2-RDM. While such marginals provide a tractable description of quantum states from which many important properties can be computed, their determination often requires a prohibitively large number of circuit repetitions. Here we describe a method by which all elements of $k$-body qubit RDMs acting on $N$ qubits can be directly measured with a number of circuits scaling as ${\cal O}(3^{k} \log^{k-1}\! N)$, an exponential improvement in $N$ over prior art. Next, we show that if one is able to implement a linear depth circuit on a linear array prior to measurement, then one can directly measure all elements of the fermionic 2-RDM using only ${\cal O}(N^2)$ circuits. We prove that this result is asymptotically optimal, thus establishing an exponential separation between the number of circuits required to directly measure all elements of qubit versus fermion RDMs. We further demonstrate a technique to estimate the expectation value of any linear combination of fermionic 2-RDM elements using ${\cal O}(N^4 / \omega)$ circuits, each with only ${\cal O}(\omega)$ gates on a linear array where $\omega \leq N$ is a free parameter. We expect these results will improve the viability of many proposals for near-term quantum simulation.

•Jan 1, 2020•74 citations

High-Order Randomized Compiler for Hamiltonian Simulation

Kouhei Nakaji, Mohsen Bagherimehrab, Alán Aspuru‐Guzik

Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in the Hamiltonian, while the systematic error is exponentially reduced with regard to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previously proposed quantum stochastic drift protocol (qDRIFT), the number of gates in which scales linearly with the inverse of the precision required. We construct the qSWIFT channel and establish a rigorous bound for the systematic error quantified by the diamond norm. qSWIFT provides an algorithm to estimate given physical quantities by using a system with one ancilla qubit, which is as simple as other product-formula-based approaches such as regular Trotter-Suzuki decompositions and qDRIFT. Our numerical experiment reveals that the required number of gates in qSWIFT is significantly reduced compared to qDRIFT. In particular, the advantage is significant for problems where high precision is required; e.g., to achieve a systematic relative propagation error of 10−6 , the required number of gates in third-order qSWIFT is 1000 times smaller than that of qDRIFT. Published by the American Physical Society 2024

arXiv:2302.14811•PRX Quantum•May 8, 2024•27 citations

Diagrammatic representation of direct measurement systems of quantum states, processes, and measurements

Kazuhisa Ogawa, H. Kobayashi, Akihisa Tomita

A diagrammatic representation that intuitively shows the relation between measurement systems using qubit probes and their outcomes is introduced. This representation enables us to design direct measurement systems of quantum states, processes, and measurements systematically.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2019•0 citations
This work investigates the mechanism by which indirect measurements can be replaced by direct ones in quantum algorithms. The authors propose a protocol to simplify the measurement of correlators in the quantum simulation and derivatives with respect to the parameters in the variational algorithms, by reducing the required number of gates.
No measurement is possible without any theory. With respect to a theory under consideration one has to distinguish between direct and indirect measurements. Direct measurements are defined by pre-theories, i.e. without the theory under consideration. The direct measurements for quantum theory are given by measurable processes on macroscopic devices. It is demonstrated how indirect measurements in quantum mechanics can be reduced to direct measurements. A theory of the measuring device is in this context not possible by quantum mechanics alone, but by a more comprehensive theory of macrosystems.
Many applications of quantum simulation require to prepare and then characterize quantum states by performing an efficient partial tomography to estimate observables corresponding to kkk-body reduced density matrices (kkk-RDMs). For instance, variational algorithms for the quantum simulation of chemistry usually require that one measure the fermionic 2-RDM. While such marginals provide a tractable description of quantum states from which many important properties can be computed, their determination often requires a prohibitively large number of circuit repetitions. Here we describe a method by which all elements of kkk-body qubit RDMs acting on NNN qubits can be directly measured with a number of circuits scaling as O(3klog⁡k−1 ⁣N){\cal O}(3^{k} \log^{k-1}\! N)O(3klogk−1N), an exponential improvement in NNN over prior art. Next, we show that if one is able to implement a linear depth circuit on a linear array prior to measurement, then one can directly measure all elements of the fermionic 2-RDM using only O(N2){\cal O}(N^2)O(N2) circuits. We prove that this result is asymptotically optimal, thus establishing an exponential separation between the number of circuits required to directly measure all elements of qubit versus fermion RDMs. We further demonstrate a technique to estimate the expectation value of any linear combination of fermionic 2-RDM elements using O(N4/ω){\cal O}(N^4 / \omega)O(N4/ω) circuits, each with only O(ω){\cal O}(\omega)O(ω) gates on a linear array where ω≤N\omega \leq Nω≤N is a free parameter. We expect these results will improve the viability of many proposals for near-term quantum simulation.
Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in the Hamiltonian, while the systematic error is exponentially reduced with regard to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previously proposed quantum stochastic drift protocol (qDRIFT), the number of gates in which scales linearly with the inverse of the precision required. We construct the qSWIFT channel and establish a rigorous bound for the systematic error quantified by the diamond norm. qSWIFT provides an algorithm to estimate given physical quantities by using a system with one ancilla qubit, which is as simple as other product-formula-based approaches such as regular Trotter-Suzuki decompositions and qDRIFT. Our numerical experiment reveals that the required number of gates in qSWIFT is significantly reduced compared to qDRIFT. In particular, the advantage is significant for problems where high precision is required; e.g., to achieve a systematic relative propagation error of 10−6 , the required number of gates in third-order qSWIFT is 1000 times smaller than that of qDRIFT. Published by the American Physical Society 2024