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:1008.3291 · Physical Review A

Unifying parameter estimation and the Deutsch-Jozsa algorithm for continuous variables

Marcin Zwierz, Carlos A. Pérez-Delgado, Pieter Kok

Published Oct 20, 2010• 9 citations
arXivHTMLPDF

Abstract

We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous-variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. Depending on which parameter we keep constant, the procedure implements either the parameter-estimation protocol or the Deutsch-Jozsa algorithm. The parameter-estimation part of the procedure attains the Heisenberg limit and is therefore optimal. Due to the use of approximate normalizable continuous-variable eigenstates, the Deutsch-Jozsa algorithm is probabilistic. The procedure estimates a value of an unknown parameter and solves the Deutsch-Jozsa problem without the use of any entanglement.

DOI
10.1103/physreva.82.042320

Related papers

Quantum Information Processing with Continuous Variables and Atomic Ensembles

Marcin Zwierz

This thesis presents three different results in quantum information theory. The first result addresses the theoretical foundations of quantum metrology. The Heisenberg limit considered as the ultimate limit in quantum metrology sets a lower bound on how precisely a physical quantity can be measured given a certain amount of resources in any possible measurement. Recently, however, several measurement procedures have been proposed in which the Heisenberg limit seemed to be surpassed. This led to an extensive debate over the question how the sensitivity scales with the physical resources and the computational resources that are used in estimation procedures. Here, we reconcile the physical definition of the relevant resources with the information-theoretical scaling in terms of the query complexity of a quantum network. This leads to a novel and ultimate Heisenberg limit that applies to all conceivable measurement procedures. The second result reveals a close relationship between quantum metrology and the Deutsch-Jozsa algorithm over continuous-variable quantum systems. Here, we develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. The procedure estimates a value of an unknown parameter with Heisenberg-limited precision or solves the Deutsch-Jozsa problem in a single run without the use of any entanglement. The third result illustrates how physical principles that govern interaction of light and matter can be efficiently employed to create a computational resource for a (one-way) quantum computer. More specifically, we demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of the so-called cluster states in a single step. This procedure is significantly more efficient than any known robust probabilistic entangling operation.

arXiv:1102.1918•Feb 9, 2011•0 citations

What does quantum parameter estimation estimate? A no-go result for true quantity values

Jacques L. Pienaar, Eran Tal, Asya Ciftci

We examine the conditions under which quantum parameter estimation is compatible with the concept of a ``true'' quantity value: a unique value of the estimated quantity that exists prior to and independently of measurement. While quantum parameter estimation typically assumes that the quantity to be estimated is a parameter, we argue that this assumption can be lifted, opening the way to a more general formulation of estimation that may apply even in situations where the quantity to be estimated is no longer a parameter, but instead a quantum variable susceptible to quantum fluctuations. We identify three assumptions that characterize the way estimation is often presented in the quantum metrology literature, namely, as a procedure for inferring an unknown ``true value", which is assumed to be unique and to exist prior to and independently of measurement. Using our more general framework, we prove a no-go theorem showing that the preceding assumptions are jointly incompatible with two further assumptions: the completeness of the quantum state (no `hidden variables'), and the presence of entanglement between the probe systems and the system under measurement. We note that the presence of such entanglement is a generic prediction of standard quantum theory. Consequently, if one is not willing to accept hidden variables, nor willing to modify standard quantum theory by introducing a new physical mechanism that destroys entanglement at some scale or regime, then a realist account of estimation is ultimately impossible.

quant-pharXiv:2610.31632•Oct 23, 2026•0 citations

Channel Simulation in Quantum Metrology

Riccardo Laurenza, Cosmo Lupo, Gaetana Spedalieri +2 more

Abstract In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels,wemay express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.

arXiv:1712.06603•Quantum Measurements and Quantum Metrology•Mar 1, 2018•39 citations

Quantum parameter estimation with general dynamics

Haidong Yuan, Chi‐Hang Fred Fung

Abstract One of the main quests in quantum metrology, and quantum parameter estimation in general, is to find out the highest achievable precision with given resources and design schemes to attain it. In this article we present a general framework for quantum parameter estimation and provide systematic methods for computing the ultimate precision limit, which is more general and efficient than conventional methods.

arXiv:1506.01909•npj Quantum Information•Apr 4, 2017•65 citations

The continuous-variable Deutsch–Jozsa algorithm using realistic quantum systems

Rob C. Wagner, Viv M. Kendon

This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Coherent states: mathematical and physical aspects'.

Journal of Physics A Mathematical and Theoretical•May 30, 2012•4 citations

Generalized Deutsch-Jozsa Algorithm for Applications in Data Classification, Logistic Regression, and Quantum Key Distribution

M. Ghadimi, V. Salari, S. Bakrani +4 more

We present a generalized Deutsch-Jozsa (DJ) quantum algorithm that not only determines both the global type of an unknown Boolean function (constant or balanced) but also determines explicit output values of the function in a single oracle query. Unlike the original DJ algorithm, which identifies only whether a function is constant or balanced, our generalization retrieves actual function output values at the same time with using a Bell state as ancilla. This makes a richer function characterization with minimal queries to have practical quantum advantages, e.g. data classification, logistic regression, and quantum cryptography.

quant-pharXiv:2512.00715•Physical Review A•Dec 2, 2025•0 citations
We reveal a close relationship between quantum metrology and the Deutsch-Jozsa algorithm on continuous-variable quantum systems. We develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. Depending on which parameter we keep constant, the procedure implements either the parameter-estimation protocol or the Deutsch-Jozsa algorithm. The parameter-estimation part of the procedure attains the Heisenberg limit and is therefore optimal. Due to the use of approximate normalizable continuous-variable eigenstates, the Deutsch-Jozsa algorithm is probabilistic. The procedure estimates a value of an unknown parameter and solves the Deutsch-Jozsa problem without the use of any entanglement.
This thesis presents three different results in quantum information theory. The first result addresses the theoretical foundations of quantum metrology. The Heisenberg limit considered as the ultimate limit in quantum metrology sets a lower bound on how precisely a physical quantity can be measured given a certain amount of resources in any possible measurement. Recently, however, several measurement procedures have been proposed in which the Heisenberg limit seemed to be surpassed. This led to an extensive debate over the question how the sensitivity scales with the physical resources and the computational resources that are used in estimation procedures. Here, we reconcile the physical definition of the relevant resources with the information-theoretical scaling in terms of the query complexity of a quantum network. This leads to a novel and ultimate Heisenberg limit that applies to all conceivable measurement procedures. The second result reveals a close relationship between quantum metrology and the Deutsch-Jozsa algorithm over continuous-variable quantum systems. Here, we develop a general procedure, characterized by two parameters, that unifies parameter estimation and the Deutsch-Jozsa algorithm. The procedure estimates a value of an unknown parameter with Heisenberg-limited precision or solves the Deutsch-Jozsa problem in a single run without the use of any entanglement. The third result illustrates how physical principles that govern interaction of light and matter can be efficiently employed to create a computational resource for a (one-way) quantum computer. More specifically, we demonstrate theoretically a scheme based on atomic ensembles and the dipole blockade mechanism for generation of the so-called cluster states in a single step. This procedure is significantly more efficient than any known robust probabilistic entangling operation.
We examine the conditions under which quantum parameter estimation is compatible with the concept of a ``true'' quantity value: a unique value of the estimated quantity that exists prior to and independently of measurement. While quantum parameter estimation typically assumes that the quantity to be estimated is a parameter, we argue that this assumption can be lifted, opening the way to a more general formulation of estimation that may apply even in situations where the quantity to be estimated is no longer a parameter, but instead a quantum variable susceptible to quantum fluctuations. We identify three assumptions that characterize the way estimation is often presented in the quantum metrology literature, namely, as a procedure for inferring an unknown ``true value", which is assumed to be unique and to exist prior to and independently of measurement. Using our more general framework, we prove a no-go theorem showing that the preceding assumptions are jointly incompatible with two further assumptions: the completeness of the quantum state (no `hidden variables'), and the presence of entanglement between the probe systems and the system under measurement. We note that the presence of such entanglement is a generic prediction of standard quantum theory. Consequently, if one is not willing to accept hidden variables, nor willing to modify standard quantum theory by introducing a new physical mechanism that destroys entanglement at some scale or regime, then a realist account of estimation is ultimately impossible.
Abstract In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels,wemay express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.
This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Coherent states: mathematical and physical aspects'.
We present a generalized Deutsch-Jozsa (DJ) quantum algorithm that not only determines both the global type of an unknown Boolean function (constant or balanced) but also determines explicit output values of the function in a single oracle query. Unlike the original DJ algorithm, which identifies only whether a function is constant or balanced, our generalization retrieves actual function output values at the same time with using a Bell state as ancilla. This makes a richer function characterization with minimal queries to have practical quantum advantages, e.g. data classification, logistic regression, and quantum cryptography.