Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication

• URL: http://arxiv.org/abs/2507.09532v1
• Date: Sun, 13 Jul 2025 08:23:12 GMT
• Title: Design and Experimental Realization of Various Protocols for Secure Quantum Computation and Communication
• Authors: Satish Kumar,
• Abstract summary: A set of new schemes for quantum computation and communication have been either designed or experimentally realized.<n>A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer.<n>Two quantum key distribution protocols, coherent one-way (COW) and differential phase shift (DPS) are experimentally demonstrated.
• Score: 2.06682776181122
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and m+1-qubit GHZ-like unknown state to a receiver (Bob), has been demonstrated using two copies of the Bell state instead of a five-qubit cluster state and implemented on IBM's quantum computer for the m=1 case. Another scheme, known as quantum broadcasting where a known state is sent to two spatially separated parties (Bob and Charlie) has also been realized using two Bell states. It is shown that existing quantum broadcasting schemes can be reduced to multiparty remote state preparation. After achieving teleportation of unknown and known states, sending a quantum operator becomes the next step. A scheme for remote implementation of operators (RIO), specifically a controlled joint-RIO (CJRIO), has been proposed using a four-qubit hyper-entangled state involving spatial and polarization degrees of freedom. In this direction, two more variants, remote implementation of hidden and partially unknown operators (RIHO and RIPUO) have also been proposed. Their success probabilities are analyzed considering dissipation of an auxiliary coherent state interacting with the environment. For secure multiparty tasks like quantum voting or auction, secure multiparty quantum computation (SMQC) becomes essential. A quantum anonymous voting (QAV) scheme has been experimentally implemented on IBM's quantum computer. Finally, two quantum key distribution (QKD) protocols, coherent one-way (COW) and differential phase shift (DPS), are experimentally demonstrated and the key rates are analyzed as functions of post-processing parameters and detector dead times across various distances.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• 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)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• An Optimized Bidirectional Quantum Teleportation Scheme with the use of Bell states [0.0]
  Bidirectional quantum teleportation scheme is a two-way quantum communication process. In this paper, we have designed an optimal scheme for bidirectional quantum teleportation scheme.
  arXiv  Detail & Related papers  (2021-12-08T08:17:59Z)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• Demonstration of quantum advantage by a joint detection receiver for optical communications using quantum belief propagation on a trapped-ion device [0.7758302353877525]
  We present an experimental realization of a quantum joint detection receiver for binary phase shift keying codewords of a 3-bit linear tree code. The receiver, translated to a quantum circuit, was experimentally implemented on a trapped-ion device. We provide an experimental framework that surpasses the quantum limit on the minimum average decoding error probability.
  arXiv  Detail & Related papers  (2021-02-25T18:05:31Z)
• Entangled state generation via quantum walks with multiple coins [2.471925498075058]
  Entanglement swapping provides an efficient method to generate entanglement in quantum communication protocols. We propose a novel scheme to generate entangled state including two-qubit entangled state, two-qudit entangled state, three-qubit GHZ state and three-qudit GHZ state between several designate parties via the model of quantum walks with multiple coins.
  arXiv  Detail & Related papers  (2020-11-03T11:39:40Z)

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.