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

Cryptographic quantum metrology

Zixin Huang, Chiara Macchiavello, Lorenzo Maccone

Published Feb 13, 2019• 38 citations
arXivHTMLPDF

Abstract

We develop a general framework for parameter estimation that allows only trusted parties to access the result and achieves optimal precision. The protocols are designed such that adversaries can access some information indeterministically, but only at the risk of getting caught (cheat sensitivity); under the assumption that the adversary can access the channel only once, then the protocol is unconditionally secure. By combining techniques from quantum cryptography and quantum metrology, we devise cryptographic procedures for single-parameter estimation when an arbitrary number of parties are involved.

DOI
10.1103/physreva.99.022314

Related papers

Protocols for optical quantum metrology

Zixin Huang

This thesis explores various protocols which can be applied to quantum metrology, such that precision of the measurement can beat the best classical approaches. We first demonstrate that ancilla-assisted schemes can improve phase estimation in the presence of noise, and we propose an experiment to demonstrate these effects. Given that the use of ancillae helps, it is no surprise that there are noisy channels for which the optimal strategy may depend on the noise level. We show that there is a non-trivial crossover between the ancilla-assisted strategy and the parallel-entangled strategy for Pauli noise channels and the amplitude damping channel. We see that under certain circumstances, the environment cannot access the parameter of interest. We then integrated techniques from quantum communication, to derive a general framework that renders quantum metrology protocols into cryptographic ones. Here the protocol is unconditionally secure if the trusted parties wish only to achieve the standard quantum limit. If Heisenberg-limited precision is to be achieved, they sacrifice some security, where adversaries can access information, but only at the risk of getting caught at it (cheat-sensitivity). In many scenarios, the quantum Fisher information is achieved for only one value of the phase. In a particular phase estimation scheme that measures the parity at the output of a Mach-Zehnder interferometer where the input is a two-mode squeezed vacuum, this problem is particularly imminent. We apply an adaptive technique to resolve this issue, showing that one can achieve precisions substantially below the shot noise limit. The key to a quadratically enhanced improvement in quantum metrology is entanglement. Finally, we demonstrate in a photonic system how high-dimensional entanglement can be certified, and provide an alternate interpretation of entanglement from an information-theoretic perspective.

•Apr 5, 2018•0 citations

Cryptographic approach to quantum metrology

Nathan Shettell, Elham Kashefi, Damian Markham

We consider a cryptographically motivated framework for quantum metrology in the presence of a malicious adversary. We begin by devising an estimation strategy for a (potentially) altered resource (due to a malicious adversary) and quantify the amount of bias and the loss in precision as a function of the introduced uncertainty in the resource. By incorporating an appropriate cryptographic protocol, the uncertainty in the resource can be bounded with respect to the soundness of the cryptographic protocol. Thus the effectiveness of the quantum metrology problem can be directly related to the effectiveness of the cryptography protocol. As an example, we consider a quantum metrology problem in which resources are exchanged through an unsecured quantum channel. We then construct two protocols for this task which offer a trade-off between difficulty of implementation and efficiency.

arXiv:2101.01762•Physical Review A•Jan 4, 2022•32 citations

Verifying the security of a continuous variable quantum communication protocol via quantum metrology

Lorcán O. Conlon, Biveen Shajilal, Angus Walsh +4 more

Abstract Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties. Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use. In a similar manner, Cramér-Rao bounds in quantum metrology place limits on how much information can be extracted from a given quantum state about some unknown parameters of interest. In this work we establish a connection between these two areas. We first demonstrate a three-party sensing protocol, where the attainable precision is dependent on how many parties work together. This protocol is then mapped to a secure access protocol, where only by working together can the parties gain access to some high security asset. Finally, we map the same task to a communication protocol where we demonstrate that a higher mutual information can be achieved when the parties work collaboratively compared to any party working in isolation.

arXiv:2311.05389•npj Quantum Information•Apr 4, 2024•15 citations

Secure multi-party quantum computation

Claude Crépeau, Daniel Gottesman, Adam Smith

Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t ξ n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 2002•17 citations

Certification of Network Quantum Sensing

Matteo Rosati, Gabriele Bizzarri, Marco Barbieri

The distribution of quantum sensors on quantum networks is a key enabler of quantum technologies in interferometry, gravimetry, timekeeping, biological monitoring, and beyond. Yet, guaranteeing the security of these distributed sensors over noisy, insecure networks remains a formidable challenge. Previous efforts to combine quantum metrology and cryptography have encountered an apparently unavoidable tension, proposing bounds for security which are only loosely tied to the achievable measurement performance. Here we introduce a quantum remote sensing protocol that can rigorously certify privacy and integrity of the estimation. By employing offline bilateral Pauli-twirling, our approach forces the effective quantum channel into a Bell-diagonal form, independently of the attack. Surprisingly, this also preserves metrological sensitivity without introducing additional experimental overhead. Relying solely on public communication alongside an insecure quantum link, the protocol enables legitimate users to exactly quantify their estimation error relative to an eavesdropper controlling the channels. We experimentally demonstrate this framework by estimating an optical phase using entangled photons, observing that the users' precision consistently surpasses the eavesdropper's capabilities across a broad parameter regime. By unifying quantum cryptography and metrology, our results provide a practical pathway to achieve simultaneous quantum-limited precision and rigorous information security in real-world quantum networks.

quant-pharXiv:2606.10700•Jun 10, 2026•1 citation

Secure Multi-party Quantum Computing

Claude Crépeau, Daniel Gottesman, Adam Smith

Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.

arXiv:quant-ph/0206138•Jun 20, 2002•25 citations
We develop a general framework for parameter estimation that allows only trusted parties to access the result and achieves optimal precision. The protocols are designed such that adversaries can access some information indeterministically, but only at the risk of getting caught (cheat sensitivity); under the assumption that the adversary can access the channel only once, then the protocol is unconditionally secure. By combining techniques from quantum cryptography and quantum metrology, we devise cryptographic procedures for single-parameter estimation when an arbitrary number of parties are involved.
This thesis explores various protocols which can be applied to quantum metrology, such that precision of the measurement can beat the best classical approaches. We first demonstrate that ancilla-assisted schemes can improve phase estimation in the presence of noise, and we propose an experiment to demonstrate these effects. Given that the use of ancillae helps, it is no surprise that there are noisy channels for which the optimal strategy may depend on the noise level. We show that there is a non-trivial crossover between the ancilla-assisted strategy and the parallel-entangled strategy for Pauli noise channels and the amplitude damping channel. We see that under certain circumstances, the environment cannot access the parameter of interest. We then integrated techniques from quantum communication, to derive a general framework that renders quantum metrology protocols into cryptographic ones. Here the protocol is unconditionally secure if the trusted parties wish only to achieve the standard quantum limit. If Heisenberg-limited precision is to be achieved, they sacrifice some security, where adversaries can access information, but only at the risk of getting caught at it (cheat-sensitivity). In many scenarios, the quantum Fisher information is achieved for only one value of the phase. In a particular phase estimation scheme that measures the parity at the output of a Mach-Zehnder interferometer where the input is a two-mode squeezed vacuum, this problem is particularly imminent. We apply an adaptive technique to resolve this issue, showing that one can achieve precisions substantially below the shot noise limit. The key to a quadratically enhanced improvement in quantum metrology is entanglement. Finally, we demonstrate in a photonic system how high-dimensional entanglement can be certified, and provide an alternate interpretation of entanglement from an information-theoretic perspective.
We consider a cryptographically motivated framework for quantum metrology in the presence of a malicious adversary. We begin by devising an estimation strategy for a (potentially) altered resource (due to a malicious adversary) and quantify the amount of bias and the loss in precision as a function of the introduced uncertainty in the resource. By incorporating an appropriate cryptographic protocol, the uncertainty in the resource can be bounded with respect to the soundness of the cryptographic protocol. Thus the effectiveness of the quantum metrology problem can be directly related to the effectiveness of the cryptography protocol. As an example, we consider a quantum metrology problem in which resources are exchanged through an unsecured quantum channel. We then construct two protocols for this task which offer a trade-off between difficulty of implementation and efficiency.
Abstract Quantum mechanics offers the possibility of unconditionally secure communication between multiple remote parties. Security proofs for such protocols typically rely on bounding the capacity of the quantum channel in use. In a similar manner, Cramér-Rao bounds in quantum metrology place limits on how much information can be extracted from a given quantum state about some unknown parameters of interest. In this work we establish a connection between these two areas. We first demonstrate a three-party sensing protocol, where the attainable precision is dependent on how many parties work together. This protocol is then mapped to a secure access protocol, where only by working together can the parties gain access to some high security asset. Finally, we map the same task to a communication protocol where we demonstrate that a higher mutual information can be achieved when the parties work collaboratively compared to any party working in isolation.
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t ξ n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.
The distribution of quantum sensors on quantum networks is a key enabler of quantum technologies in interferometry, gravimetry, timekeeping, biological monitoring, and beyond. Yet, guaranteeing the security of these distributed sensors over noisy, insecure networks remains a formidable challenge. Previous efforts to combine quantum metrology and cryptography have encountered an apparently unavoidable tension, proposing bounds for security which are only loosely tied to the achievable measurement performance. Here we introduce a quantum remote sensing protocol that can rigorously certify privacy and integrity of the estimation. By employing offline bilateral Pauli-twirling, our approach forces the effective quantum channel into a Bell-diagonal form, independently of the attack. Surprisingly, this also preserves metrological sensitivity without introducing additional experimental overhead. Relying solely on public communication alongside an insecure quantum link, the protocol enables legitimate users to exactly quantify their estimation error relative to an eavesdropper controlling the channels. We experimentally demonstrate this framework by estimating an optical phase using entangled photons, observing that the users' precision consistently surpasses the eavesdropper's capabilities across a broad parameter regime. By unifying quantum cryptography and metrology, our results provide a practical pathway to achieve simultaneous quantum-limited precision and rigorous information security in real-world quantum networks.
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are information-theoretically secure, i.e. no assumptions are made on the computational power of the adversary. For the weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6.