RECORD
State learning from pairs of states
Quantum Physics · Submitted 17 Sep 2024
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that if an additional copy of each qubit is supplied -- that is, one receives pairs of qubits, both in the same state, rather than single qubits -- the task can be accomplished.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning -- or quantum state estimation. A problem is that, without more information, all that can be determined is the density matrix of the sequence and, in general, density matrices can be decomposed into pure states in many different ways. To solve the problem, additional information, either classical or quantum, is required. We show that if an additional copy of each qubit is supplied -- that is, one receives pairs of qubits, both in the same state, rather than single qubits -- the task can be accomplished. This is possible because the mixed two-qubit state has a unique decomposition into pure product states. For illustration, we simulate numerically the symmetric, informationally complete measurement of a sequence of qubit pairs and show that the unknown states and their respective probabilities of occurrence can be inferred from the data with high accuracy. Finally, we propose an experiment that employs a product measurement and can be realized with existing technology, and we demonstrate how the data tell us the states and their probabilities. We find that it is enough to detect a few thousand qubit pairs.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. | background 1.00 | 0.06 | 0.02 | asserted 0.76 |
| s1 | Your task is to determine the states. | background 0.98 | 0.04 | 0.02 | asserted 0.79 |
| s2 | This can be viewed as a kind of quantum state learning -- or quantum state estimation. | background 0.80 | 0.09 | 0.04 | asserted 0.64 |
| s3 | A problem is that, without more information, all that can be determined is the density matrix of the sequence and, in general, density matrices can be decomposed into pure states in many different ways. | gap 0.54 | 0.11 | 0.03 | asserted 0.93 |
| s4 | To solve the problem, additional information, either classical or quantum, is required. | gap 0.73 | 0.08 | 0.05 | asserted 0.99 |
| s5 | We show that if an additional copy of each qubit is supplied -- that is, one receives pairs of qubits, both in the same state, rather than single qubits -- the task can be accomplished. | contribution 0.70 | 0.83 | 0.82 | asserted 0.96 |
| s6 | This is possible because the mixed two-qubit state has a unique decomposition into pure product states. | interpretation 0.74 | 0.38 | 0.22 | asserted 1.00 |
| s7 | For illustration, we simulate numerically the symmetric, informationally complete measurement of a sequence of qubit pairs and show that the unknown states and their respective probabilities of occurrence can be inferred from the data with high accuracy. | method 0.38 | 0.95 | 0.13 | asserted 0.99 |
| s8 | Finally, we propose an experiment that employs a product measurement and can be realized with existing technology, and we demonstrate how the data tell us the states and their probabilities. | contribution 0.49 | 0.88 | 0.13 | asserted 0.98 |
| s9 | We find that it is enough to detect a few thousand qubit pairs. | result 1.00 | 0.91 | 0.16 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning -- or quantum state estimation. A problem is that, without more information, all that can be determined is the density matrix of the sequence and, in general, density matrices can be decomposed into pure states in many different ways. To solve the problem, additional information, either classical or quantum, is required. We show that if an additional copy of each qubit is supplied -- that is, one receives pairs of qubits, both in the same state, rather than single qubits -- the task can be accomplished. This is possible because the mixed two-qubit state has a unique decomposition into pure product states. For illustration, we simulate numerically the symmetric, informationally complete measurement of a sequence of qubit pairs and show that the unknown states and their respective probabilities of occurrence can be inferred from the data with high accuracy. Finally, we propose an experiment that employs a product measurement and can be realized with existing technology, and we demonstrate how the data tell us the states and their probabilities. We find that it is enough to detect a few thousand qubit pairs.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites
Uses the method or tool of 1 paper
-
For the purpose of finding the maximum of $L()$, we use a covariance matrix adaptation evolution strategy (CMA-ES), adapted from [ref] , to find the minimum of $-N^-1log(L())$.
The CMA Evolution Strategy: A Tutorial · Simulated data · 1.00
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.