An official website of the United States government
Abstract We determine the optimal measurement that maximizes the average information gain about the state of a qubit system. The qubit is prepared in one of two known states with known prior probabilities. To treat the problem analytically we employ the formalism developed for the maximum confidence quantum state discrimination strategy and obtain the POVM which optimizes the information gain for the entire parameter space of the system. We show that the optimal measurement coincides exactly with the minimum-error quantum measurement only for two pure states, or when the two states have the same Bloch radius or they are on the same diagonal of the Bloch disk.
more »
« less
State learning from pairs of states
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. The 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 purposes, we numerically simulate 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.
more »
« less
- PAR ID:
- 10618373
- Publisher / Repository:
- American Physical Society
- Date Published:
- Journal Name:
- Physical Review A
- Volume:
- 111
- Issue:
- 6
- ISSN:
- 2469-9926
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Most existing quantum algorithms are discovered accidentally or adapted from classical algorithms, and there is the need for a systematic theory to understand and design quantum circuits. Here we develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. Compared to the conventional entanglement description of quantum circuits and states, the unitary dependence picture offers more practical information on the measurement and manipulation of qubits, easier generalization to many-qubit systems, and better robustness upon partitioning of the system. The unitary dependence theory can be applied to systematically understand existing quantum circuits and design new quantum algorithms.more » « less
-
Using IBM's publicly accessible quantum computers, we have analyzed the entropies of Schrödinger's cat states, which have the form Ψ = (1/2) 1/2 [|0 0 0⋯0〉 + |1 1 1⋯1〉]. We have obtained the average Shannon entropy S So of the distribution over measurement outcomes from 75 runs of 8192 shots, for each of the numbers of entangled qubits, on each of the quantum computers tested. For the distribution over N fault-free measurements on pure cat states, S So would approach one as N → ∞, independent of the number of qubits; but we have found that S So varies nearly linearly with the number of qubits n . The slope of S So versus the number of qubits differs among computers with the same quantum volumes. We have developed a two-parameter model that reproduces the near-linear dependence of the entropy on the number of qubits, based on the probabilities of observing the output 0 when a qubit is set to |0〉 and 1 when it is set to |1〉. The slope increases as the error rate increases. The slope provides a sensitive measure of the accuracy of a quantum computer, so it serves as a quickly determinable index of performance. We have used tomographic methods with error mitigation as described in the qiskit documentation to find the density matrix ρ and evaluate the von Neumann entropies of the cat states. From the reduced density matrices for individual qubits, we have calculated the entanglement entropies. The reduced density matrices represent mixed states with approximately 50/50 probabilities for states |0〉 and |1〉. The entanglement entropies are very close to one.more » « less
-
Abstract The Pauli exclusion principle governs the fundamental structure and function of fermionic systems from molecules to materials. Nonetheless, when such a fermionic system is in a pure state, it is subject to additional restrictions known as the generalized Pauli constraints (GPCs). Here we verify experimentally the violation of the GPCs for an open quantum system using data from a superconducting-qubit quantum computer. We prepare states of systems with three-to-seven qubits directly on the quantum device and measure the one-fermion reduced density matrix (1-RDM) from which we can test the GPCs. We find that the GPCs of the 1-RDM are sufficiently sensitive to detect the openness of the 3-to-7 qubit systems in the presence of a single-qubit environment. Results confirm experimentally that the openness of a many-fermion quantum system can be decoded from only a knowledge of the 1-RDM with potential applications from quantum computing and sensing to noise-assisted energy transfer.more » « less
-
Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states, ρ+ and ρ− , the Helstrom measurement distinguishes between them with minimal probability of error. However, finding and experimentally implementing the Helstrom measurement can be challenging for quantum states on many qubits. Due to this difficulty, there is a great interest in identifying local measurement schemes which are close to optimal. In the first part of this work, we generalize previous work by Acin et al. (Phys. Rev. A 71, 032338) and show that a locally greedy (LG) scheme using Bayesian updating can optimally distinguish between any two states that can be written as a tensor product of arbitrary pure states. We then show that the same algorithm cannot distinguish tensor products of mixed states with vanishing error probability (even in a large subsystem limit), and introduce a modified locally-greedy (MLG) scheme with strictly better performance. In the second part of this work, we compare these simple local schemes with a general dynamic programming (DP) approach. The DP approach finds the optimal series of local measurements and optimal order of subsystem measurement to distinguish between the two tensor-product states.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- https://doi.org/10.1103/tyf3-1zdd
