Efficient decoding of stabilizer code by single-qubit local operations and classical communication

• URL: http://arxiv.org/abs/2308.14054v1
• Date: Sun, 27 Aug 2023 09:19:59 GMT
• Title: Efficient decoding of stabilizer code by single-qubit local operations and classical communication
• Authors: Koki Shiraishi, Hayata Yamasaki, Mio Murao
• Abstract summary: We construct a protocol for extracting distributed one-qubit quantum information encoded in a stabilizer code of multiple qubits. This protocol achieves efficient extraction within a time in terms of the number of physical qubits.
• Score: 2.5322020135765464
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We construct a protocol for extracting distributed one-qubit quantum information encoded in a stabilizer code of multiple qubits, only by single-qubit local operations and classical communication (LOCC) without global operations or entanglement resources. This protocol achieves efficient extraction within a polynomial time in terms of the number of physical qubits. We apply this protocol to a setting of quantum information splitting where a subset of spatially separated parties cooperate by classical communication to extract quantum information shared among all the parties. For this task, our LOCC extraction protocol allows designing hierarchical information access structures among the parties, where the minimum number of parties required to cooperate depends on the location of extracting the shared quantum information. These results provide a fundamental building block of distributed quantum information processing that requires access to distributed quantum information encoded in the stabilizer codes.

Related papers

• Quantum Entanglement Allocation through a Central Hub [12.641563181229623]
  We propose local operations and classical communication protocols for allocating $N$-qubit W states within a centralized hub architecture. Results show that these protocols deterministically and exactly distribute states using only $N$ qubits of quantum memory within the central system, with communication costs of $2N - 2$ and $N$ classical bits for the W and GHZ states, respectively.
  arXiv  Detail & Related papers  (2024-09-12T16:06:28Z)
• eQMARL: Entangled Quantum Multi-Agent Reinforcement Learning for Distributed Cooperation over Quantum Channels [98.314893665023]
  Quantum computing has sparked a potential synergy between quantum entanglement and cooperation in multi-agent environments. Current state-of-the-art quantum MARL (QMARL) implementations rely on classical information sharing. eQMARL is a distributed actor-critic framework that facilitates cooperation over a quantum channel.
  arXiv  Detail & Related papers  (2024-05-24T18:43:05Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Quantum map approach to entanglement transfer and generation in spin chains [0.0]
  Quantum information processing protocols are efficiently implemented on spin-$frac12$ networks. We reformulate widely investigated protocols, such as one-qubit quantum state transfer and two-qubit entanglement distribution, with the quantum map formalism.
  arXiv  Detail & Related papers  (2021-12-04T14:32:26Z)
• Absolutely Secure Distributed Superdense Coding: Entanglement Requirement for Optimality [0.0]
  A superdense coding method is optimal when its capacity reaches Holevo bound. We show that for optimality, maximal entanglement is a necessity across the bipartition of Alice and Bob. We construct a distributed dense coding method, which completely depicts absolutely secure one way quantum communication between many to one party.
  arXiv  Detail & Related papers  (2021-11-01T16:29:04Z)
• Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [1.3812010983144802]
  Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations. This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
  arXiv  Detail & Related papers  (2021-09-03T08:52:17Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Practical distributed quantum information processing with LOCCNet [8.633408580670812]
  We introduce LOCCNet, a machine learning framework facilitating protocol design and optimization for distributed quantum information processing tasks. As applications, we explore various quantum information tasks such as entanglement distillation, quantum state discrimination, and quantum channel simulation. An implementation of LOCCNet is available in Paddle Quantum, a quantum machine learning Python package based on PaddlePaddle deep learning platform.
  arXiv  Detail & Related papers  (2021-01-28T18:53:12Z)

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.