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:1312.4240

Direct observation of any two-point quantum correlation function

Francesco Buscemi, Michele Dall’Arno, Masanao Ozawa, Vlatko Vedral

Published Dec 16, 2013• 60 citations
arXivHTMLPDF

Abstract

The existence of noncompatible observables in quantum theory makes a direct operational interpretation of two-point correlation functions problematic. Here we challenge such a view by explicitly constructing a measuring scheme that, independently of the input state $ρ$ and observables $A$ and $B$, performs an unbiased optimal estimation of the two-point correlation function $\operatorname{Tr}[A \ ρ\ B]$. This shows that, also in quantum theory, two-point correlation functions are as operational as any other expectation value. A very simple probabilistic implementation of our proposal is presented.

DOI
10.48550/arxiv.1312.4240

Related papers

Universal optimal quantum correlator

Francesco Buscemi, Michele Dall'Arno, Masanao Ozawa +1 more

Recently, a novel operational strategy to access quantum correlation functions of the form Tr[AρB] was provided in [F. Buscemi, M. Dall'Arno, M. Ozawa and V. Vedral, arXiv:1312.4240]. Here we propose a realization scheme, that we call partial expectation values, implementing such strategy in terms of a unitary interaction with an ancillary system followed by the measurement of an observable on the ancilla. Our scheme is universal, being independent of ρ, A, and B, and it is optimal in a statistical sense. Our scheme is suitable for implementation with present quantum optical technology, and provides a new way to test uncertainty relations.

arXiv:1409.2237•International Journal of Quantum Information•Oct 28, 2014•19 citations

Observable Measure of Bipartite Quantum Correlations

Davide Girolami, Gerardo Adesso

We introduce a measure Q of bipartite quantum correlations for arbitrary two-qubit states, expressed as a state-independent function of the density matrix elements. The amount of quantum correlations can be quantified experimentally by measuring the expectation value of a small set of observables on up to four copies of the state, without the need for a full tomography. We extend the measure to 2×d systems, providing its explicit form in terms of observables and applying it to the relevant class of multiqubit states employed in the deterministic quantum computation with one quantum bit model. The number of required measurements to determine Q in our scheme does not increase with d. Our results provide an experimentally friendly framework to estimate quantitatively the degree of general quantum correlations in composite systems.

arXiv:1110.5083•Physical Review Letters•Apr 13, 2012•112 citations

Optimal quantum measurements of expectation values of observables

Emanuel H. Knill, Gerardo Ortíz, Rolando D. Somma

Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of the quantum system. Such expectation values can be measured by repeatedly preparing $\ensuremath{\mid}\ensuremath{\psi}⟩$ and coupling the system to an apparatus. For this method, the precision of the measured value scales as $\frac{1}{\sqrt{N}}$ for $N$ repetitions of the experiment. For the problem of estimating the parameter $\ensuremath{\phi}$ in an evolution ${e}^{\ensuremath{-}i\ensuremath{\phi}H}$, it is possible to achieve precision $\frac{1}{N}$ [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about $H$ and its spectrum is available. We consider the more general problem of estimating expectations of operators $A$ with minimal prior knowledge of $A$. We give explicit algorithms that approach precision $\frac{1}{N}$ given a bound on the eigenvalues of $A$ or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of $\ensuremath{\mid}\ensuremath{\psi}⟩$ and $U\ensuremath{\mid}\ensuremath{\psi}⟩$, where $U$ is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.

arXiv:quant-ph/0607019•Physical Review A•Jan 24, 2007•207 citations

An observable based approach to evaluating quantum coherence

Suman Mandal, Marek Narożniak, Chandrashekar Radhakrishnan +4 more

We introduce a procedure based on quantum expectation values of measurement observables to characterize quantum coherence. In a bipartite system, the two-point correlation function is used in combination with the Schatten-1 norm to estimate the quantum coherence. This definition of coherence allows the decomposition into contributions corresponding to the non-classical correlations between the subsystems and localized on each subsystem. We illustrate the method for several bipartite systems, showing that an incomplete basis still gives a qualitative measure of the coherence.

AIP conference proceedings•Jan 1, 2020•0 citations

Variance reduction methods in the estimation of Pauli sums

Søren Fuglede Jørgensen, Rafael Emilio Barfknecht, Patrick Ettenhuber +1 more

Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.

quant-pharXiv:2603.20029•Mar 23, 2026•0 citations

Determining which quantum measurement performs better for state estimation

Jaroslav Řeháček, Yong Siah Teo, Z. Hradil

We introduce an operational and statistically meaningful measure, the quantum tomographic transfer function, that possesses important physical invariance properties for judging whether a given informationally complete quantum measurement performs better tomographically in quantum-state estimation relative to other informationally complete measurements. This function is independent of the unknown true state of the quantum source and is directly related to the average optimal tomographic accuracy of an unbiased state estimator for the measurement in the limit of many sampling events. For the experimentally appealing minimally complete measurements, the transfer function is an extremely simple formula. We also give an explicit expression for this transfer function in terms of an ordered expansion that is readily computable and illustrate its usage with numerical simulations and its consistency with some known results.

arXiv:1410.4004•Physical Review A•Jul 13, 2015•20 citations
The existence of noncompatible observables in quantum theory makes a direct operational interpretation of two-point correlation functions problematic. Here we challenge such a view by explicitly constructing a measuring scheme that, independently of the input state ρρρ and observables AAA and BBB, performs an unbiased optimal estimation of the two-point correlation function Tr⁡[A ρ B]\operatorname{Tr}[A \ ρ\ B]Tr[A ρ B]. This shows that, also in quantum theory, two-point correlation functions are as operational as any other expectation value. A very simple probabilistic implementation of our proposal is presented.
Recently, a novel operational strategy to access quantum correlation functions of the form Tr[AρB] was provided in [F. Buscemi, M. Dall'Arno, M. Ozawa and V. Vedral, arXiv:1312.4240]. Here we propose a realization scheme, that we call partial expectation values, implementing such strategy in terms of a unitary interaction with an ancillary system followed by the measurement of an observable on the ancilla. Our scheme is universal, being independent of ρ, A, and B, and it is optimal in a statistical sense. Our scheme is suitable for implementation with present quantum optical technology, and provides a new way to test uncertainty relations.
We introduce a measure Q of bipartite quantum correlations for arbitrary two-qubit states, expressed as a state-independent function of the density matrix elements. The amount of quantum correlations can be quantified experimentally by measuring the expectation value of a small set of observables on up to four copies of the state, without the need for a full tomography. We extend the measure to 2×d systems, providing its explicit form in terms of observables and applying it to the relevant class of multiqubit states employed in the deterministic quantum computation with one quantum bit model. The number of required measurements to determine Q in our scheme does not increase with d. Our results provide an experimentally friendly framework to estimate quantitatively the degree of general quantum correlations in composite systems.
Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state $\ensuremath{\mid}\ensuremath{\psi}⟩$ of the quantum system. Such expectation values can be measured by repeatedly preparing $\ensuremath{\mid}\ensuremath{\psi}⟩$ and coupling the system to an apparatus. For this method, the precision of the measured value scales as 1N\frac{1}{\sqrt{N}}N​1​ for NNN repetitions of the experiment. For the problem of estimating the parameter $\ensuremath{\phi}$ in an evolution ${e}^{\ensuremath{-}i\ensuremath{\phi}H}$, it is possible to achieve precision 1N\frac{1}{N}N1​ [the quantum metrology limit; see Giovannetti et al., Phys. Rev. Lett. 96, 010401 (2006)] provided that sufficient information about HHH and its spectrum is available. We consider the more general problem of estimating expectations of operators AAA with minimal prior knowledge of AAA. We give explicit algorithms that approach precision 1N\frac{1}{N}N1​ given a bound on the eigenvalues of AAA or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of $\ensuremath{\mid}\ensuremath{\psi}⟩$ and $U\ensuremath{\mid}\ensuremath{\psi}⟩$, where UUU is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.
We introduce a procedure based on quantum expectation values of measurement observables to characterize quantum coherence. In a bipartite system, the two-point correlation function is used in combination with the Schatten-1 norm to estimate the quantum coherence. This definition of coherence allows the decomposition into contributions corresponding to the non-classical correlations between the subsystems and localized on each subsystem. We illustrate the method for several bipartite systems, showing that an incomplete basis still gives a qualitative measure of the coherence.
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
We introduce an operational and statistically meaningful measure, the quantum tomographic transfer function, that possesses important physical invariance properties for judging whether a given informationally complete quantum measurement performs better tomographically in quantum-state estimation relative to other informationally complete measurements. This function is independent of the unknown true state of the quantum source and is directly related to the average optimal tomographic accuracy of an unbiased state estimator for the measurement in the limit of many sampling events. For the experimentally appealing minimally complete measurements, the transfer function is an extremely simple formula. We also give an explicit expression for this transfer function in terms of an ordered expansion that is readily computable and illustrate its usage with numerical simulations and its consistency with some known results.