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

Measurement disturbance tradeoffs in three-qubit unsupervised quantum classification

Hector Spencer-Wood, John Jeffers, Sarah Croke

Published Jun 27, 2022• 2 citations
arXivHTMLPDF

Abstract

We consider measurement disturbance tradeoffs in quantum machine learning protocols which seek to learn about quantum data. We study the simplest example of a binary classification task in the unsupervised regime. Specifically, we investigate how a classification of two qubits, that can each be in one of two unknown states, affects our ability to perform a subsequent classification on three qubits when a third is added. Surprisingly, we find a range of strategies in which a nontrivial first classification does not affect the success rate of the second classification. There is, however, a nontrivial measurement disturbance tradeoff between the success rate of the first and second classifications, and we fully characterize this tradeoff analytically.

DOI
10.1103/physreva.105.062447

Related papers

Limitations of measure-first protocols in quantum machine learning

Casper Gyurik, Riccardo Molteni, Vedran Dunjko

In recent works, much progress has been made with regards to so-called randomized measurement strategies, which include the famous methods of classical shadows and shadow tomography. In such strategies, unknown quantum states are first measured (or ``learned''), to obtain classical data that can be used to later infer (or ``predict'') some desired properties of the quantum states. Even if the used measurement procedure is fixed, surprisingly, estimations of an exponential number of vastly different quantities can be obtained from a polynomial amount of measurement data. This raises the question of just how powerful ``measure-first'' strategies are, and in particular, if all quantum machine learning problems can be solved with a measure-first, analyze-later scheme. This paper explores the potential and limitations of these measure-first protocols in learning from quantum data. We study a natural supervised learning setting where quantum states constitute data points, and the labels stem from an unknown measurement. We examine two types of machine learning protocols: ``measure-first'' protocols, where all the quantum data is first measured using a fixed measurement strategy, and ``fully-quantum'' protocols where the measurements are adapted during the training process. Our main result is a proof of separation. We prove that there exist learning problems that can be efficiently learned by fully-quantum protocols but which require exponential resources for measure-first protocols. Moreover, we show that this separation persists even for quantum data that can be prepared by a polynomial-time quantum process, such as a polynomially-sized quantum circuit. Our proofs combine methods from one-way communication complexity and pseudorandom quantum states. Our result underscores the role of quantum data processing in machine learning and highlights scenarios where quantum advantages appear.

arXiv:2311.12618•Nov 21, 2023•14 citations

Information-Disturbance Tradeoff in Estimating the Unknown Three-Qubit GHZ State

Zhang Sheng-Li, Xu‐Bo Zou, Ke Li +2 more

In a recent paper, Sacchi (Phys. Rev. Lett. 96 (2006) 220502) studied the information-disturbance tradeoff in estimating an unknown two-qubit maximally entangled state. In this study, we explore the tradeoff in estimating an unknown three-qubit GHZ state. The optimal estimation process supplies a fidelity of (13/54) and the tradeoff interpolates smoothly between non-informative measurement and optimal estimation process.

Chinese Physics Letters•Jun 1, 2007•2 citations

Tradeoff relations for two-valued qubit measurements

Huarui Xing, Shuming Cheng, Lijun Liu

Quantum measurement is essentially taken to gain information encoded in quantum states, however, it also inevitably disturbs the measured state such that the postmeasurement state loses its quantum information partially or fully. Thus, it is an important issue to characterise such information gain and state disturbance associated with measurement. In this work, we study the relationships between the information gain and measurement disturbance for two-valued qubit measurements. In particular, we employ a powerful tradeoff relation between the measurement strength and reversibility to obtain, generalise, and even strengthen certain well-known tradeoff relations between information gain and measurement disturbance of qubit measurements. Moreover, it is pointed out that our results are useful to understand the measurement effects at the fundamental level as they are state-independent. Hence, our work is helpful for designing quantum information processing tasks aided by measurement.

Chinese Control Conference (CCC)•Jul 26, 2021•0 citations

What we can do with one qubit in quantum machine learning: ten classical machine learning problems that can be solved with a single qubit

Manuel Pegalájar Cuéllar

This work focuses on quantum machine learning and analyzes the power of one single qubit to solve classical machine learning problems. We explore possible strategies to address traditional supervised, unsupervised, and reinforcement learning tasks. In particular, we study binary and multinomial classification, regression problems, time series forecasting, clustering, and quantum reinforcement learning. Our results suggest that the same methodology could be used to address all three types of learning with different measurement strategies and, despite the strong limitation of reduced data dimensionality of the candidate problems, a single qubit can achieve similar or even improved performance with respect to state-of-the-art classic machine learning methods in many cases. As simulating the evolution of one qubit state is computationally efficient, our study enables the possibility to use the qubit model as a candidate solution to implement simple decision-making machine learning models in hardware with extremely low memory resources such as embedded systems or edge devices. The outcomes provided could be also of interest in academia and for the construction of demonstrators using low-scale contemporary quantum hardware.

Quantum Machine Intelligence•Nov 12, 2024•10 citations

Unsupervised Classification of Quantum Data

Gael Sentís, Alex Monràs, R. Muñoz-Tapia +2 more

We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown.We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are of two types.Our protocol is universal and able to automatically sort the input under minimal assumptions, yet partially preserves information contained in the states.We quantify analytically its performance for an arbitrary size and dimension of the data.We contrast it with the performance of its classical counterpart, which clusters data that have been sampled from two unknown probability distributions.We find that the quantum protocol fully exploits the dimensionality of the quantum data to achieve a much higher performance, provided the data are at least three dimensional.For the sake of comparison, we discuss the optimal protocol when the classical and quantum states are known.

arXiv:1903.01391•Physical Review X•Nov 8, 2019•44 citations

Measurement sharpness and disturbance tradeoff

Nayere Saberian, Seyed Javad Akhtarshenas, Fereshte Shahbeigi

Obtaining information from a quantum system through a measurement typically disturbs its state. The postmeasurement states for a given measurement, however, are not unique and highly rely on the chosen measurement model, complicating the puzzle of information disturbance. Two distinct questions are then in order. First, what is the minimum disturbance a measurement may induce? Second, when a fixed disturbance occurs, how informative is the possible measurement in the best-case scenario? Here we propose various approaches to tackle these questions and provide explicit solutions for the set of unbiased binary qubit measurements and postmeasurement state spaces that are equivalent to the image of a unital qubit channel. In particular, we show there are different tradeoff relations between the sharpness of this measurement and the average fidelity of the premeasurement and postmeasurement state spaces as well as the sharpness and quantum resources preserved in the postmeasurement states in terms of coherence and discordlike correlation once the measurement is applied locally.

arXiv:2308.04133•Physical Review A•Jan 2, 2024•6 citations
We consider measurement disturbance tradeoffs in quantum machine learning protocols which seek to learn about quantum data. We study the simplest example of a binary classification task in the unsupervised regime. Specifically, we investigate how a classification of two qubits, that can each be in one of two unknown states, affects our ability to perform a subsequent classification on three qubits when a third is added. Surprisingly, we find a range of strategies in which a nontrivial first classification does not affect the success rate of the second classification. There is, however, a nontrivial measurement disturbance tradeoff between the success rate of the first and second classifications, and we fully characterize this tradeoff analytically.
In recent works, much progress has been made with regards to so-called randomized measurement strategies, which include the famous methods of classical shadows and shadow tomography. In such strategies, unknown quantum states are first measured (or ``learned''), to obtain classical data that can be used to later infer (or ``predict'') some desired properties of the quantum states. Even if the used measurement procedure is fixed, surprisingly, estimations of an exponential number of vastly different quantities can be obtained from a polynomial amount of measurement data. This raises the question of just how powerful ``measure-first'' strategies are, and in particular, if all quantum machine learning problems can be solved with a measure-first, analyze-later scheme. This paper explores the potential and limitations of these measure-first protocols in learning from quantum data. We study a natural supervised learning setting where quantum states constitute data points, and the labels stem from an unknown measurement. We examine two types of machine learning protocols: ``measure-first'' protocols, where all the quantum data is first measured using a fixed measurement strategy, and ``fully-quantum'' protocols where the measurements are adapted during the training process. Our main result is a proof of separation. We prove that there exist learning problems that can be efficiently learned by fully-quantum protocols but which require exponential resources for measure-first protocols. Moreover, we show that this separation persists even for quantum data that can be prepared by a polynomial-time quantum process, such as a polynomially-sized quantum circuit. Our proofs combine methods from one-way communication complexity and pseudorandom quantum states. Our result underscores the role of quantum data processing in machine learning and highlights scenarios where quantum advantages appear.
Quantum measurement is essentially taken to gain information encoded in quantum states, however, it also inevitably disturbs the measured state such that the postmeasurement state loses its quantum information partially or fully. Thus, it is an important issue to characterise such information gain and state disturbance associated with measurement. In this work, we study the relationships between the information gain and measurement disturbance for two-valued qubit measurements. In particular, we employ a powerful tradeoff relation between the measurement strength and reversibility to obtain, generalise, and even strengthen certain well-known tradeoff relations between information gain and measurement disturbance of qubit measurements. Moreover, it is pointed out that our results are useful to understand the measurement effects at the fundamental level as they are state-independent. Hence, our work is helpful for designing quantum information processing tasks aided by measurement.
This work focuses on quantum machine learning and analyzes the power of one single qubit to solve classical machine learning problems. We explore possible strategies to address traditional supervised, unsupervised, and reinforcement learning tasks. In particular, we study binary and multinomial classification, regression problems, time series forecasting, clustering, and quantum reinforcement learning. Our results suggest that the same methodology could be used to address all three types of learning with different measurement strategies and, despite the strong limitation of reduced data dimensionality of the candidate problems, a single qubit can achieve similar or even improved performance with respect to state-of-the-art classic machine learning methods in many cases. As simulating the evolution of one qubit state is computationally efficient, our study enables the possibility to use the qubit model as a candidate solution to implement simple decision-making machine learning models in hardware with extremely low memory resources such as embedded systems or edge devices. The outcomes provided could be also of interest in academia and for the construction of demonstrators using low-scale contemporary quantum hardware.
We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown.We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are of two types.Our protocol is universal and able to automatically sort the input under minimal assumptions, yet partially preserves information contained in the states.We quantify analytically its performance for an arbitrary size and dimension of the data.We contrast it with the performance of its classical counterpart, which clusters data that have been sampled from two unknown probability distributions.We find that the quantum protocol fully exploits the dimensionality of the quantum data to achieve a much higher performance, provided the data are at least three dimensional.For the sake of comparison, we discuss the optimal protocol when the classical and quantum states are known.
Obtaining information from a quantum system through a measurement typically disturbs its state. The postmeasurement states for a given measurement, however, are not unique and highly rely on the chosen measurement model, complicating the puzzle of information disturbance. Two distinct questions are then in order. First, what is the minimum disturbance a measurement may induce? Second, when a fixed disturbance occurs, how informative is the possible measurement in the best-case scenario? Here we propose various approaches to tackle these questions and provide explicit solutions for the set of unbiased binary qubit measurements and postmeasurement state spaces that are equivalent to the image of a unital qubit channel. In particular, we show there are different tradeoff relations between the sharpness of this measurement and the average fidelity of the premeasurement and postmeasurement state spaces as well as the sharpness and quantum resources preserved in the postmeasurement states in terms of coherence and discordlike correlation once the measurement is applied locally.