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:quant-ph/0403161 · Physical Review A

Decoherence-full subsystems and the cryptographic power of a private shared reference frame

Stephen D. Bartlett, Terry Rudolph, Robert W. Spekkens

Published Sep 10, 2004• 61 citations
arXivHTMLPDF

Abstract

We show that private shared reference frames can be used to perform private quantum and private classical communication over a public quantum channel. Such frames constitute a type of private shared correlation, distinct from private classical keys or shared entanglement, useful for cryptography. We present optimally efficient schemes for private quantum and classical communication given a finite number of qubits transmitted over an insecure channel and given a private shared Cartesian frame and∕or a private shared reference ordering of the qubits. We show that in this context, it is useful to introduce the concept of a decoherence-full subsystem, wherein every state is mapped to the completely mixed state under the action of the decoherence.

DOI
10.1103/physreva.70.032307

Related papers

Private quantum channels

Andris Ambainis, Michele Mosca, Alain Tapp +1 more

We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular, we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme.

Annual Symposium on Foundations of Computer Science•Nov 7, 2002•218 citations

Classical and Quantum Communication without a Shared Reference Frame

Stephen D. Bartlett, Terry Rudolph, Robert W. Spekkens

We show that communication without a shared reference frame is possible using entangled states. Both classical and quantum information can be communicated with perfect fidelity without a shared reference frame at a rate that asymptotically approaches one classical bit or one encoded qubit per transmitted qubit. We present an optical scheme to communicate classical bits without a shared reference frame using entangled photon pairs and linear optical Bell state measurements.

arXiv:quant-ph/0302111•Physical Review Letters•Jul 7, 2003•178 citations

Complementarity of private and correctable subsystems in quantum cryptography and error correction

Dennis Kretschmann, David W. Kribs, Robert W. Spekkens

We make an explicit connection between fundamental notions in quantum cryptography and quantum error correction. Error-correcting subsystems (and subspaces) for quantum channels are the key vehicles for contending with noise in physical implementations of quantum information processing. Private subsystems (and subspaces) for quantum channels play a central role in cryptographic schemes such as quantum secret sharing and private quantum communication. We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel. This result is shown to hold even for approximate notions of private and correctable defined in terms of the diamond norm for superoperators.

arXiv:0711.3438•Physical Review A•Sep 24, 2008•35 citations

Random subspaces for encryption based on a private shared Cartesian frame

Stephen D. Bartlett, Patrick M. Hayden, Robert W. Spekkens

A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum capacities.

arXiv:quant-ph/0506260•Physical Review A•Nov 23, 2005•20 citations

Public-key cryptography based on bounded quantum reference frames

Lawrence M. Ioannou, Michele Mosca

We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-verifier assumption. Thus, we also demonstrate that secure reusable quantum-public-key authentication is possible to some extent.

arXiv:0903.5156•Mar 30, 2009•6 citations

Protocol and applications for sharing quantum private keys

Hanwei Wang, Tien-Sheng Lin, I-Ming Tsai +1 more

Transmitting message in secret is getting more and more important nowadays. In the classical world, the message we sent run the risk of being intercepted by an attacker. As a result, we have to encrypt the message, or send it using a private channel. However, if we transmit messages via such methods, there are still some ways to decipher the information. For example, a powerful computer can be used to decrypt the message or try to steal the message from the private channel. In quantum cryptography, entanglement can be used as a secure channel to transmit information with absolute secrecy. From this perspective, quantum entanglement pairs are equivalent to a quantum private key. However, like the classical key distribution problem, the entanglement has to be shared before it can be used. In this paper, we propose a protocol that can be used to distribute such entanglement pairs securely, so they can be subsequently used to transmit messages with perfect security. The security of this protocol is based on the laws of nature, instead of unproven mathematical hard problems.

IEEE International Carnahan Conference on Security Technology (ICCST)•Jan 1, 2005•7 citations
We show that private shared reference frames can be used to perform private quantum and private classical communication over a public quantum channel. Such frames constitute a type of private shared correlation, distinct from private classical keys or shared entanglement, useful for cryptography. We present optimally efficient schemes for private quantum and classical communication given a finite number of qubits transmitted over an insecure channel and given a private shared Cartesian frame and∕or a private shared reference ordering of the qubits. We show that in this context, it is useful to introduce the concept of a decoherence-full subsystem, wherein every state is mapped to the completely mixed state under the action of the decoherence.
We make an explicit connection between fundamental notions in quantum cryptography and quantum error correction. Error-correcting subsystems (and subspaces) for quantum channels are the key vehicles for contending with noise in physical implementations of quantum information processing. Private subsystems (and subspaces) for quantum channels play a central role in cryptographic schemes such as quantum secret sharing and private quantum communication. We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel. This result is shown to hold even for approximate notions of private and correctable defined in terms of the diamond norm for superoperators.
A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum capacities.
We demonstrate that the framework of bounded quantum reference frames has application to building quantum-public-key cryptographic protocols and proving their security. Thus, the framework we introduce can be seen as a public-key analogue of the framework of Bartlett et al. (Phys. Rev. A 70, 032307), where a private shared reference frame is shown to have cryptographic application. The protocol we present in this paper is an identification scheme, which, like a digital signature scheme, is a type of authentication scheme. We prove that our protocol is both reusable and secure under the honest-verifier assumption. Thus, we also demonstrate that secure reusable quantum-public-key authentication is possible to some extent.
Transmitting message in secret is getting more and more important nowadays. In the classical world, the message we sent run the risk of being intercepted by an attacker. As a result, we have to encrypt the message, or send it using a private channel. However, if we transmit messages via such methods, there are still some ways to decipher the information. For example, a powerful computer can be used to decrypt the message or try to steal the message from the private channel. In quantum cryptography, entanglement can be used as a secure channel to transmit information with absolute secrecy. From this perspective, quantum entanglement pairs are equivalent to a quantum private key. However, like the classical key distribution problem, the entanglement has to be shared before it can be used. In this paper, we propose a protocol that can be used to distribute such entanglement pairs securely, so they can be subsequently used to transmit messages with perfect security. The security of this protocol is based on the laws of nature, instead of unproven mathematical hard problems.