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/0310088 · Physical Review A

Superselection rules and quantum protocols

Alexei Kitaev, Dominic Mayers, John P. Preskill

Published May 21, 2004• 156 citations
arXivHTMLPDF

Abstract

We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system---in a world subject to a superselection rule, unrestricted operations can be simulated by parties who share access to a reference system with suitable properties. By this method, we prove that if an $n$-party protocol is secure in a world subject to a superselection rule, then the security is maintained even if the superselection rule is relaxed. However, the proof applies only to a limited class of superselection rules, those in which the superselection sectors are labeled by unitary irreducible representations of a compact symmetry group. The second method uses the concept of the format of a message sent between parties---by verifying the format, the recipient of a message can check whether the message could have been sent by a party who performed charge-conserving operations. By this method, we prove that protocols subject to general superselection rules (including those pertaining to non-Abelian anyons in two dimensions) are no more secure than protocols in the unrestricted world. However, the proof applies only to two-party protocols. Our results show in particular that, if no assumptions are made about the computational power of the cheater, then secure quantum bit commitment and strong quantum coin flipping with arbitrarily small bias are impossible in a world subject to superselection rules.

DOI
10.1103/physreva.69.052326

Related papers

Superselection Rules in Quantum Cryptography

Dominic Mayers

It is believed that superselection rules in quantum mechanics can restrict the possible operation on a qbit. If this was true, the model used by Mayers for the impossibility of bit commitment and by Kitaev for the impossibility of coin flipping would be inadequate. We explain why this is not the case. We show that a charge superselection rule implies no restriction on the operations that can be executed on any individual qbit.

arXiv:quant-ph/0212159•Dec 31, 2002•4 citations

A Secured Quantum Two-Bit Commitment Protocol for Communication Systems

Manal Khawasik, Wagdy Gomaa El-Sayed, Magdi Z. Rashad +1 more

Bit commitment is an essential primitive in quantum cryptography. It is the basic building block of many cryptographic protocols in which it provides security over distrustful parties. This paper proposes a secured quantum two-bit commitment protocol for any two classical bits. The protocol contains two parties - a committer and a receiver - who share both quantum and classical communication channels. The main phases of this protocol are commitment and revealing phases where the concealing and binding conditions are proved in order to accept the commitment message. The proposed framework utilizes different security layers to hide specific quantum states in a superposition alongside trivial one qubit operations. The secured unitary transformations are applied by the two parties to meet the concealing and binding conditions. To verify the success of the proposed protocol, the measured output of the two parties are compared. The protocol operates under the assumption that the two parties might cheat and the possible existence of an eavesdropper.

IEEE Access•Jan 1, 2022•8 citations

Verifying Entanglement of Constrained Bipartite Quantum Systems

Jones, Steven

Microscopic physical systems requiring a quantum description are increasingly being harnessed to develop useful technologies. The appeal of such an approach lies in the fact that quantum systems possess inherently different properties from those observed on a macroscopic scale. Uniquely quantum phenomena, such as entanglement, offer new tools for performing experimental tasks. For instance, the use of quantum systems for implementing cryptographic protocols and performing computation has caused significant excitement in recent years as it seems likely that the quantum approach offers an advantage over purely classical implementations. The development of quantum technologies leads to the concept of quantum resources. One key quantum resource that lies at the heart of the divergence between quantum and classical descriptions is that of entanglement. However, for entanglement to act as a resource, it must be possible for the parties (we will restrict ourselves to only two) sharing the entanglement to verify its presence. This may seem like a simple task, however, verifying the properties of quantum systems can be nontrivial. To make matters more complicated, there are often constraints under which the parties sharing the quantum systems find themselves which further restrict the ability of the quantum systems to act as a resource. One family of constraints arises when the two parties are dealing with quantum systems which have properties constrained by a conservation law, or some other constraint which limits knowledge of the properties of the local subsystems. These constraints can be expressed using the well studied formalism of superselection rules. When a superselection rule applies to quantum systems it can be ambiguous as to whether entanglement survives between the systems. This thesis considers a situation that arises naturally in a nuclear magnetic resonance experiment where two parties share many copies of identical quantum systems. In this case a superselection rule associated with the finite symmetric group applies due to the indistinguishability of the systems. The concept of a reference frame for the symmetric group is used to alleviate the effect of the superselection rule and demonstrate when entanglement survives despite the constraint of indistinguishability. In addition to this, a situation which goes beyond the superselection formalism is considered, one where the operations performable by the two parties are further constrained. It is shown that despite this stronger constraint, it is still possible in principle to verify the existence of entanglement experimentally as demonstrated by the violation of a Bell inequality. Methods for verifying the presence of entanglement can also prove useful in characterising the properties of entangled quantum systems. Such characterisation may offer insight into the possible advantages offered by quantum systems over their classical counterparts. It becomes possible to more accurately characterise entangled systems by considering a conceptual constraint under which the two parties may find themselves. This is the situation that arises when one of the parties, say Bob, distrusts the other, Alice. In this situation, Alice can only convince Bob of the presence of their entanglement if the entangled system they share possesses a certain property. We term this property steerability, after Schrödinger’s term “steering” [Proc. Camb. Phil. Soc. 31, 553 (1935)] for the Einstein-Podolsky-Rosen effect. This thesis offers a rigorous characterisation of steering in a quantum information context and probes a number of questions relating to this property. First, a number of examples are presented which demonstrate state steerability which is a uniquely quantum property possessed by certain entangled states. Second, the task of experimentally detecting steerability, and thus entanglement, is addressed through the introduction of steerability criteria. Finally two more detailed examples are explored which illustrate various aspects of the measurement dependence of steerability in realistic experiments.

•Jan 1, 2009•0 citations

Security trade-offs in ancilla-free quantum bit commitment in the presence of superselection rules

David Peter Divincenzo, John A. Smolin, Barbara M. Terhal

Security trade-offs have previously been established for one-way bit commitment. We study this trade-off in two superselection settings. We show that for an [lsquo]abelian[rsquo] superselection rule (exemplified by particle conservation), the standard trade-off between sealing and binding properties still holds. For the non-abelian case (exemplified by angular momentum conservation), the security trade-off can be more subtle, which we illustrate by showing that if the bit commitment is forced to be ancilla-free, an asymptotically secure quantum bit commitment is possible.

arXiv:quant-ph/0405111•New Journal of Physics•Jul 13, 2004•5 citations

Quantum cryptography -- an information theoretic security

Nadeem, Muhammad

Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.

arXiv:1507.07918•Jul 28, 2015•3 citations

Quantum state targeting

Terry Rudolph, Robert W. Spekkens

We introduce a primitive for quantum cryptography that we term ``state targeting.'' We show that increasing one's probability of success in this task above a minimum amount implies an unavoidable increase in the probability of a particular kind of failure. This is analogous to the unavoidable disturbance to a quantum state that results from gaining information about its identity, and can be shown to be a purely quantum effect. We solve various optimization problems for state targeting that are useful for the security analysis of two-party cryptographic tasks implemented between remote antagonistic parties. Although we focus on weak coin flipping, the results are significant for other two-party protocols, such as strong coin flipping, partially binding and concealing bit commitment, and bit escrow. Furthermore, the results have significance not only for the traditional notion of security in cryptography, that of restricting a cheater's ability to bias the outcome of the protocol, but also for a different notion of security that arises only in the quantum context, that of cheat sensitivity. Finally, our analysis leads to some interesting secondary results, namely, a generalization of Uhlmann's theorem and an operational interpretation of the fidelity between two mixed states.

arXiv:quant-ph/0310060•Physical Review A•Nov 1, 2004•14 citations
We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system---in a world subject to a superselection rule, unrestricted operations can be simulated by parties who share access to a reference system with suitable properties. By this method, we prove that if an nnn-party protocol is secure in a world subject to a superselection rule, then the security is maintained even if the superselection rule is relaxed. However, the proof applies only to a limited class of superselection rules, those in which the superselection sectors are labeled by unitary irreducible representations of a compact symmetry group. The second method uses the concept of the format of a message sent between parties---by verifying the format, the recipient of a message can check whether the message could have been sent by a party who performed charge-conserving operations. By this method, we prove that protocols subject to general superselection rules (including those pertaining to non-Abelian anyons in two dimensions) are no more secure than protocols in the unrestricted world. However, the proof applies only to two-party protocols. Our results show in particular that, if no assumptions are made about the computational power of the cheater, then secure quantum bit commitment and strong quantum coin flipping with arbitrarily small bias are impossible in a world subject to superselection rules.
Bit commitment is an essential primitive in quantum cryptography. It is the basic building block of many cryptographic protocols in which it provides security over distrustful parties. This paper proposes a secured quantum two-bit commitment protocol for any two classical bits. The protocol contains two parties - a committer and a receiver - who share both quantum and classical communication channels. The main phases of this protocol are commitment and revealing phases where the concealing and binding conditions are proved in order to accept the commitment message. The proposed framework utilizes different security layers to hide specific quantum states in a superposition alongside trivial one qubit operations. The secured unitary transformations are applied by the two parties to meet the concealing and binding conditions. To verify the success of the proposed protocol, the measured output of the two parties are compared. The protocol operates under the assumption that the two parties might cheat and the possible existence of an eavesdropper.
Microscopic physical systems requiring a quantum description are increasingly being harnessed to develop useful technologies. The appeal of such an approach lies in the fact that quantum systems possess inherently different properties from those observed on a macroscopic scale. Uniquely quantum phenomena, such as entanglement, offer new tools for performing experimental tasks. For instance, the use of quantum systems for implementing cryptographic protocols and performing computation has caused significant excitement in recent years as it seems likely that the quantum approach offers an advantage over purely classical implementations. The development of quantum technologies leads to the concept of quantum resources. One key quantum resource that lies at the heart of the divergence between quantum and classical descriptions is that of entanglement. However, for entanglement to act as a resource, it must be possible for the parties (we will restrict ourselves to only two) sharing the entanglement to verify its presence. This may seem like a simple task, however, verifying the properties of quantum systems can be nontrivial. To make matters more complicated, there are often constraints under which the parties sharing the quantum systems find themselves which further restrict the ability of the quantum systems to act as a resource. One family of constraints arises when the two parties are dealing with quantum systems which have properties constrained by a conservation law, or some other constraint which limits knowledge of the properties of the local subsystems. These constraints can be expressed using the well studied formalism of superselection rules. When a superselection rule applies to quantum systems it can be ambiguous as to whether entanglement survives between the systems. This thesis considers a situation that arises naturally in a nuclear magnetic resonance experiment where two parties share many copies of identical quantum systems. In this case a superselection rule associated with the finite symmetric group applies due to the indistinguishability of the systems. The concept of a reference frame for the symmetric group is used to alleviate the effect of the superselection rule and demonstrate when entanglement survives despite the constraint of indistinguishability. In addition to this, a situation which goes beyond the superselection formalism is considered, one where the operations performable by the two parties are further constrained. It is shown that despite this stronger constraint, it is still possible in principle to verify the existence of entanglement experimentally as demonstrated by the violation of a Bell inequality. Methods for verifying the presence of entanglement can also prove useful in characterising the properties of entangled quantum systems. Such characterisation may offer insight into the possible advantages offered by quantum systems over their classical counterparts. It becomes possible to more accurately characterise entangled systems by considering a conceptual constraint under which the two parties may find themselves. This is the situation that arises when one of the parties, say Bob, distrusts the other, Alice. In this situation, Alice can only convince Bob of the presence of their entanglement if the entangled system they share possesses a certain property. We term this property steerability, after Schrödinger’s term “steering” [Proc. Camb. Phil. Soc. 31, 553 (1935)] for the Einstein-Podolsky-Rosen effect. This thesis offers a rigorous characterisation of steering in a quantum information context and probes a number of questions relating to this property. First, a number of examples are presented which demonstrate state steerability which is a uniquely quantum property possessed by certain entangled states. Second, the task of experimentally detecting steerability, and thus entanglement, is addressed through the introduction of steerability criteria. Finally two more detailed examples are explored which illustrate various aspects of the measurement dependence of steerability in realistic experiments.
Security trade-offs have previously been established for one-way bit commitment. We study this trade-off in two superselection settings. We show that for an [lsquo]abelian[rsquo] superselection rule (exemplified by particle conservation), the standard trade-off between sealing and binding properties still holds. For the non-abelian case (exemplified by angular momentum conservation), the security trade-off can be more subtle, which we illustrate by showing that if the bit commitment is forced to be ancilla-free, an asymptotically secure quantum bit commitment is possible.
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.
We introduce a primitive for quantum cryptography that we term ``state targeting.'' We show that increasing one's probability of success in this task above a minimum amount implies an unavoidable increase in the probability of a particular kind of failure. This is analogous to the unavoidable disturbance to a quantum state that results from gaining information about its identity, and can be shown to be a purely quantum effect. We solve various optimization problems for state targeting that are useful for the security analysis of two-party cryptographic tasks implemented between remote antagonistic parties. Although we focus on weak coin flipping, the results are significant for other two-party protocols, such as strong coin flipping, partially binding and concealing bit commitment, and bit escrow. Furthermore, the results have significance not only for the traditional notion of security in cryptography, that of restricting a cheater's ability to bias the outcome of the protocol, but also for a different notion of security that arises only in the quantum context, that of cheat sensitivity. Finally, our analysis leads to some interesting secondary results, namely, a generalization of Uhlmann's theorem and an operational interpretation of the fidelity between two mixed states.