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:2011.02216 · Nature Communications

Analysis and optimization of quantum adaptive measurement protocols with the framework of preparation games

Mirjam Weilenmann, Edgar A. Aguilar, Miguel Navascués

Published Jul 27, 2021• 11 citations
arXivHTMLPDF

Abstract

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. Many experimental tasks in quantum information, such as entanglement quantification or magic state detection, can be cast as preparation games. In this paper, we introduce general methods to design n-round preparation games, with tight bounds on the performance achievable by players with arbitrarily constrained preparation devices. We illustrate our results by devising new adaptive measurement protocols for entanglement detection and quantification. Surprisingly, we find that the standard procedure in entanglement detection, namely, estimating n times the average value of a given entanglement witness, is in general suboptimal for detecting the entanglement of a specific quantum state. On the contrary, there exist n-round experimental scenarios where detecting the entanglement of a known state optimally requires adaptive measurement schemes.

DOI
10.1038/s41467-021-24658-9

Related papers

Optimization of Time-Ordered Processes in the Finite and Asymptotic Regimes

Mirjam Weilenmann, Costantino Budroni, Miguel Navascués

Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through adaptive measurements, computing the maximum average score of a preparation game over a continuous set of target states, and limiting the behavior of a (quantum) finite-state automaton. In this work, we introduce tractable relaxations of this class of optimization problems. To illustrate their performance, we use them to: (a) compute the probability that a finite-state automaton outputs a given sequence of bits; (b) develop a new many-body entanglement-detection protocol; and (c) let the computer an adaptive protocol for magic state detection. As we further show, the maximum score of a sequential problem in the limit of infinitely many time steps is in general incomputable. Nonetheless, we provide general heuristics to bound this quantity and show that they provide useful estimates in relevant scenarios. Published by the American Physical Society 2024

arXiv:2302.02918•PRX Quantum•Jun 3, 2024•2 citations

Efficient quantum state analysis and entanglement detection

Lukas Knips

Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.

•Jan 1, 2019•1 citation

Self-testing in a constrained prepare-measure scenario sans assuming quantum dimension

Ritesh K. Singh, Souradeep Sasmal, S Nautiyal +1 more

Abstract We present a self-testing protocol in a constrained prepare-measure scenario, based on a communication game known as parity-oblivious multiplexing (POM) task. In this scenario, a parity-oblivious constraint is imposed on the preparations, allowing us to define a classical bound derived from a preparation noncontextual ontological model. We demonstrate that the optimal quantum value exceeds preparation noncontextual bound and therefore enables self-testing of the preparations and the measurement devices. Contrasting the prevailing consensus that the self-testing in prepare-measure scenario inevitably requires an upper bound on the dimension of the quantum system, we derive the optimal quantum success probability of the POM task devoid of assuming the dimension of the quantum system. Furthermore, by proving the existence of a unitary, we show that the optimal preparations and measurements in an unknown but finite dimensional Hilbert space, responsible for the observed input–output correlations, can be mapped, via a unitary, onto a known finite-dimensional quantum system. Our results thus pave the way for scalable, single system based certification protocols in the prepare-measure scenario.

arXiv:2505.19581•New Journal of Physics•Nov 1, 2025•4 citations

A monogamy-of-entanglement game with applications to device-independent quantum cryptography

Marco Tomamichel, Serge Fehr, Jędrzej Kaniewski +1 more

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. Firstly, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices , i.e. we show that BB84 is one-sided device independent. Secondly, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information.

arXiv:1210.4359•New Journal of Physics•Oct 2, 2013•169 citations

Strategies for large dynamic range, entanglement-enhanced quantum metrology with experimentally demonstrated resources

Tyler G. Thurtell

Quantum metrology studies the use of quantum mechanical systems as measurement devices or sensors. Surprisingly, preparing a sensor in an entangled state can enhance measurement precision. The simplest protocols for entanglement enhancement sense only small changes in a quantity. The range of values over which a measurement protocol works is called its dynamic range. For many types of sensors we require end-to-end protocols that describe how to use entanglement to achieve enhanced precision over a large dynamic range. In this dissertation, we describe two approaches to achieving entanglement-enhanced sensing over a large dynamic range. The first approach uses entangling resources in a way that circumvents the dynamic-range limitation by numerically optimizing variational circuits. Our protocols show improved performance at fixed circuit depth compared to previous variational-circuit-based approaches, and the generality of our approach reveals several generic features of such protocols. The second approach uses adaptivity to first obtain a preliminary estimate of the quantity and then iteratively refines it. In particular, we describe the use of one-axis twisting dynamics at each stage of this protocol to minimize the expected estimation error.

•Jul 28, 2026•0 citations

Quantum Entanglement-Based Adaptive Measurement Algorithm

Jincheng Zhang

Quantum entanglement, a bizarre phenomenon where two or more particles become linked in such a way that they share the same fate, holds immense potential for technological advancement. This paper investigates the application of quantum entanglement to the design of an adaptive measurement algorithm, aiming to enhance measurement precision and efficiency. Traditional measurement techniques often rely on fixed parameters, limiting their ability to optimize performance. We propose a novel approach leveraging the dynamic interplay between entangled states and adjustable parameters to achieve this. The core mechanism centers around exploiting the inherent correlations within entangled systems to dynamically adjust measurement settings, resulting in improved accuracy and reduced computational burden. This research explores the theoretical and practical aspects of this algorithm, emphasizing its potential impact on various measurement scenarios.

•Aug 31, 2026•0 citations
A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. Many experimental tasks in quantum information, such as entanglement quantification or magic state detection, can be cast as preparation games. In this paper, we introduce general methods to design n-round preparation games, with tight bounds on the performance achievable by players with arbitrarily constrained preparation devices. We illustrate our results by devising new adaptive measurement protocols for entanglement detection and quantification. Surprisingly, we find that the standard procedure in entanglement detection, namely, estimating n times the average value of a given entanglement witness, is in general suboptimal for detecting the entanglement of a specific quantum state. On the contrary, there exist n-round experimental scenarios where detecting the entanglement of a known state optimally requires adaptive measurement schemes.
Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through adaptive measurements, computing the maximum average score of a preparation game over a continuous set of target states, and limiting the behavior of a (quantum) finite-state automaton. In this work, we introduce tractable relaxations of this class of optimization problems. To illustrate their performance, we use them to: (a) compute the probability that a finite-state automaton outputs a given sequence of bits; (b) develop a new many-body entanglement-detection protocol; and (c) let the computer an adaptive protocol for magic state detection. As we further show, the maximum score of a sequential problem in the limit of infinitely many time steps is in general incomputable. Nonetheless, we provide general heuristics to bound this quantity and show that they provide useful estimates in relevant scenarios. Published by the American Physical Society 2024
Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.
Abstract We present a self-testing protocol in a constrained prepare-measure scenario, based on a communication game known as parity-oblivious multiplexing (POM) task. In this scenario, a parity-oblivious constraint is imposed on the preparations, allowing us to define a classical bound derived from a preparation noncontextual ontological model. We demonstrate that the optimal quantum value exceeds preparation noncontextual bound and therefore enables self-testing of the preparations and the measurement devices. Contrasting the prevailing consensus that the self-testing in prepare-measure scenario inevitably requires an upper bound on the dimension of the quantum system, we derive the optimal quantum success probability of the POM task devoid of assuming the dimension of the quantum system. Furthermore, by proving the existence of a unitary, we show that the optimal preparations and measurements in an unknown but finite dimensional Hilbert space, responsible for the observed input–output correlations, can be mapped, via a unitary, onto a known finite-dimensional quantum system. Our results thus pave the way for scalable, single system based certification protocols in the prepare-measure scenario.
We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. Firstly, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices , i.e. we show that BB84 is one-sided device independent. Secondly, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information.
Quantum metrology studies the use of quantum mechanical systems as measurement devices or sensors. Surprisingly, preparing a sensor in an entangled state can enhance measurement precision. The simplest protocols for entanglement enhancement sense only small changes in a quantity. The range of values over which a measurement protocol works is called its dynamic range. For many types of sensors we require end-to-end protocols that describe how to use entanglement to achieve enhanced precision over a large dynamic range. In this dissertation, we describe two approaches to achieving entanglement-enhanced sensing over a large dynamic range. The first approach uses entangling resources in a way that circumvents the dynamic-range limitation by numerically optimizing variational circuits. Our protocols show improved performance at fixed circuit depth compared to previous variational-circuit-based approaches, and the generality of our approach reveals several generic features of such protocols. The second approach uses adaptivity to first obtain a preliminary estimate of the quantity and then iteratively refines it. In particular, we describe the use of one-axis twisting dynamics at each stage of this protocol to minimize the expected estimation error.
Quantum entanglement, a bizarre phenomenon where two or more particles become linked in such a way that they share the same fate, holds immense potential for technological advancement. This paper investigates the application of quantum entanglement to the design of an adaptive measurement algorithm, aiming to enhance measurement precision and efficiency. Traditional measurement techniques often rely on fixed parameters, limiting their ability to optimize performance. We propose a novel approach leveraging the dynamic interplay between entangled states and adjustable parameters to achieve this. The core mechanism centers around exploiting the inherent correlations within entangled systems to dynamically adjust measurement settings, resulting in improved accuracy and reduced computational burden. This research explores the theoretical and practical aspects of this algorithm, emphasizing its potential impact on various measurement scenarios.