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

Workshop on Physics and Computation (PhysComp)

Storage And Retrieval Of Quantum Information

Asher Peres

Published Aug 24, 2005• 1 citation
Publisher

Abstract

Information encoded in non-orthogonal quantum states cannot be duplicated, nor amplified, and in general at is only partly recoverable. The most efficient way of retrieving it is not a direct uquantum measurement” (as defined by von Neumann), but an indirect method similar to heterodyne detection in communications engineering. The mathematical representation of this process requires the introduction of a positive operator valued measure. The optimization of these measures is not yet fully undersiood. An interesting and potentially important application of quantum information is its use an cryptography.

DOI
10.1109/phycmp.1992.615515

Related papers

Discrimination of Quantum States with selected Applications

János A. Bergou

In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out which is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we begin with a brief introduction to the theory of generalized measurements and illustrate the power of the concept on examples relevant to applications in quantum cryptography.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2007•4 citations

Discrimination of quantum states with selected applications

János A. Bergou

In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out what is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we illustrate the power of the POVM concept on examples relevant to applications in quantum cryptography. In order to keep the flow of the presentation we give a brief introduction to the theory of generalized measurements in an appendix.

Contemporary Physics•May 1, 2008•0 citations

Quantum information processing

Stephen Mark Barnett

We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.

Oxford University Press eBooks•May 28, 2009•11 citations

Lossless Quantum Data Compression and Secure Direct Communication- New concepts and methods for quantum information theory

Kim Joris Boström

•Nov 5, 2007•0 citations

Quantum Cryptography And Quantum Information Processing

N. Imoto

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Jan 1, 1997•0 citations

ERROR-FREE DEFINITION OF THE QUANTUM BELL STATE IN QUANTUM CRYPTOGRAPHY

Богдан Білаш, O.М. Lysenko

Scientific notes of Taurida National V I Vernadsky University Series Technical Sciences•Jan 1, 2022•0 citations
Information encoded in non-orthogonal quantum states cannot be duplicated, nor amplified, and in general at is only partly recoverable. The most efficient way of retrieving it is not a direct uquantum measurement” (as defined by von Neumann), but an indirect method similar to heterodyne detection in communications engineering. The mathematical representation of this process requires the introduction of a positive operator valued measure. The optimization of these measures is not yet fully undersiood. An interesting and potentially important application of quantum information is its use an cryptography.
In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out which is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we begin with a brief introduction to the theory of generalized measurements and illustrate the power of the concept on examples relevant to applications in quantum cryptography.
In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out what is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we illustrate the power of the POVM concept on examples relevant to applications in quantum cryptography. In order to keep the flow of the presentation we give a brief introduction to the theory of generalized measurements in an appendix.
We have seen how information can be encoded onto a quantum system by selecting the state in which it is prepared. Retrieving the information is achieved by performing a measurement, and the optimal measurement in any given situation is usually a generalized measurement. In between preparation and measurement, the information resides in the quantum state of the system, which evolves in a manner determined by the Hamiltonian. The associated unitary transformation may usefully be viewed as quantum information processing; if we can engineer an appropriate Hamiltonian then we can use the quantum evolution to assist in performing computational tasks. Our objective in quantum information processing is to implement a desired unitary transformation. Typically this will mean coupling together a number, perhaps a large number, of qubits and thereby generating highly entangled states. It is fortunate, although by no means obvious, that we can realize any desired multiqubit unitary transformation as a product of a small selection of simple transformations and, moreover, that each of these need only act on a single qubit or on a pair of qubits. The situation is reminiscent of digital electronics, in which logic operations are decomposed into actions on a small number of bits. If we can realize and control a very large number of such operations in a single device then we have a computer. Similar control of a large number of qubits will constitute a quantum computer. It is the revolutionary potential of quantum computers, more than any other single factor, that has fuelled the recent explosion of interest in our subject. We shall examine the remarkable properties of quantum computers in the next chapter. In digital electronics, we represent bit values by voltages: the logical value 1 is a high voltage (typically +5 V) and 0 is the ground voltage (0 V). The voltage bits are coupled and manipulated by transistor-based devices, or gates. The simplest gates act on only one bit or combine two bits to generate a single new bit, the value of which is determined by the two input bits. For a single bit, with value 0 or 1, the only possible operations are the identity (which does not require a gate) and the bit flip.