A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
- URL: http://arxiv.org/abs/2306.10825v2
- Date: Thu, 20 Jul 2023 00:40:36 GMT
- Title: A Quantum Detectable Byzantine Agreement Protocol using only EPR pairs
- Authors: Theodore Andronikos, Alla Sirokofskich
- Abstract summary: This paper introduces a new quantum protocol for Detectable Byzantine Agreement.
It uses only EPR pairs, and, in particular, $Psi + $ pairs.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we introduce a new quantum protocol for Detectable Byzantine
Agreement. What distinguishes the proposed protocol among similar quantum
protocols, is the fact that it uses only EPR pairs, and, in particular, $\Psi^{
+ }$ pairs. There are many sophisticated quantum protocols that guarantee
Detectable Byzantine Agreement, but they do not easily lend themselves to
practical implementations, due to present-day technological limitations. For a
large number $n$ of players, GHZ $n$-tuples, or other more exotic entangled
states, are not easy to produce, a fact which might complicate the scalability
of such protocols. In contrast, Bell states are, undoubtedly, the easiest to
generate among maximally entangled states. This will, hopefully, facilitate the
scalability of the proposed protocol, as only EPR pairs are required,
irrespective of the number $n$ of players. Finally, we mention that, even for
arbitrary many players $n$, our protocol always completes in a constant number
of rounds, namely $4$.
Related papers
- A Multiparty Quantum Private Equality Comparison scheme relying on $\ket{ GHZ_{ 3 } }$ states [0.0]
This paper introduces an innovative entanglement-based protocol that accomplishes multiparty quantum private comparison.
It is made possible because the protocol uses only GHZ3 triplets, irrespective of the number of millionaires.
The protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other's secret numbers.
arXiv Detail & Related papers (2024-07-07T14:21:22Z) - Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass.
Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements.
We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
arXiv Detail & Related papers (2024-05-24T17:33:10Z) - An optimal tradeoff between entanglement and copy complexity for state
tomography [24.737530909081915]
We study tomography in the natural setting where one can make measurements of $t$ copies at a time.
This is the first smooth entanglement-copy protocol known for any quantum learning task.
A key insight is to use SchurilonWeyl sampling not to estimate the spectrum of $rho$, but to estimate the deviation of $rho$ from the maximally mixed state.
arXiv Detail & Related papers (2024-02-26T07:18:57Z) - An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol
Using Bell States [16.277401577186605]
Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al.
Zhu et al. pointed out that there are some security flaws and proposed an improved version.
This study shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.
arXiv Detail & Related papers (2023-09-22T09:02:18Z) - Quantum Two-Way Communication Protocol Beyond Superdense Coding [36.25599253958745]
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.
The proposed protocol gives a 50% increase in both data rate and energy efficiency compared to the classical protocol.
arXiv Detail & Related papers (2023-09-06T08:48:07Z) - Secure Computation with Shared EPR Pairs (Or: How to Teleport in
Zero-Knowledge) [26.90896904213257]
We show that em secure teleportation through quantum channels is possible.
Specifically, given the description of any quantum operation $Q$, a sender with (quantum) input $rho$ can send a single classical message that securely transmits $Q(rho)$ to a receiver.
arXiv Detail & Related papers (2023-04-20T17:29:26Z) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Quantum private comparison via cavity QED [0.0]
The proposed protocol adopts two-atom product states rather than entangled states as the initial quantum resource.
The qubit efficiency of the proposed protocol is as high as 50%.
arXiv Detail & Related papers (2022-05-09T02:37:06Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Single-state semiquantum private comparison based on Bell states [3.312385039704987]
novel semiquantum private comparison (SQPC) protocol based on single kind of Bell states is proposed.
TP is allowed to misbehave on her own but cannot conspire with anyone else.
arXiv Detail & Related papers (2021-11-27T05:48:45Z) - Rigidity of superdense coding [3.4113536110736766]
Superdense coding is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair.
We show that the sender and receiver only use additional entanglement as a source of classical randomness.
Unlike the $d=2$ case (i.e. sending a single qubit), there can be inequivalent superdense coding protocols for higher $d$.
arXiv Detail & Related papers (2020-12-03T03:04:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.