When quantum memory is useful for dense coding

• URL: http://arxiv.org/abs/2306.11237v2
• Date: Sun, 9 Jun 2024 04:59:04 GMT
• Title: When quantum memory is useful for dense coding
• Authors: Ryuji Takagi, Masahito Hayashi,
• Abstract summary: We discuss dense coding with $n$ copies of a specific preshared state between the sender and the receiver. We investigate what preshared state offers an advantage of using quantum memory on the receiver's side.
• Score: 45.41082277680607
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss dense coding with $n$ copies of a specific preshared state between the sender and the receiver when the encoding operation is limited to the application of group representation. Typically, to act on multiple local copies of these preshared states, the receiver needs quantum memory, because in general the multiple copies will be generated sequentially. Depending on available encoding unitary operations, we investigate what preshared state offers an advantage of using quantum memory on the receiver's side.

Related papers

• A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources [0.0]
  We present a publicly verifiable quantum money protocol which assumes close to no quantum computational capabilities.<n>We rely on one-time memories which in turn can be built from quantum conjugate coding and hardware-based assumptions.
  arXiv  Detail & Related papers  (2025-12-24T17:48:03Z)
• Quantum Storage of Qubits in an Array of Independently Controllable Solid-State Quantum Memories [0.0]
  Solid-state quantum memories may offer computational advantages for quantum computers and networks.<n>We perform quantum storage of path and time-bin qubits implemented with weak coherent states at the single-photon level.<n>We find average fidelities of $95_-2+2;%$ for path qubits and $91+2_-2;%$ for time-bin qubits.
  arXiv  Detail & Related papers  (2025-09-15T13:30:13Z)
• Continuous-Variable Multiplexed Quantum Repeater Networks [0.0]
  We propose a quantum repeater protocol based on cat codes with a few quantum memories or graph states as additional resources. This allows us to considerably increase the secret key rate by several orders of magnitude.
  arXiv  Detail & Related papers  (2024-11-22T06:27:30Z)
• All-photonic one-way quantum repeaters [15.3862808585761]
  We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction. We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
  arXiv  Detail & Related papers  (2022-10-18T18:07:19Z)
• Quantum Multiple-Access One-Time Pad [9.137554315375919]
  We introduce and analyze an information theoretical task that we call the quantum multiple-access one-time pad. A number of senders initially share a correlated quantum state with a receiver and an eavesdropper. We derive a single-letter characterization for the achievable rate region in a limit of infinitely many copies and vanishingly small error.
  arXiv  Detail & Related papers  (2022-08-25T11:43:24Z)
• Quantum secure direct communication with private dense coding using general preshared quantum state [59.99354397281036]
  We study secure direct communication by using a general preshared quantum state and a generalization of dense coding. For a practical application, we propose a concrete protocol and derive an upper bound of information leakage.
  arXiv  Detail & Related papers  (2021-12-30T16:12:07Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Sufficient conditions for quantum advantage in random access code protocols with two-qubit states [1.0323063834827415]
  Random access code (RAC) is an important communication protocol. We consider either communication of quantum bits or a shared-in-advance quantum state used in conjunction with classical communication. For $n geq 4$ RACs assisted with a single copy of a quantum state do not outperform the classical RACs.
  arXiv  Detail & Related papers  (2019-12-20T15:58:50Z)

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.