Perfect pure quantum state transfer via state restoring and ancilla measurement

• URL: http://arxiv.org/abs/2509.10100v2
• Date: Tue, 16 Sep 2025 12:12:13 GMT
• Title: Perfect pure quantum state transfer via state restoring and ancilla measurement
• Authors: E. B. Fel'dman, J. Wu, A. I. Zenchuk,
• Abstract summary: We show that the sender's state can be restored at the receiver using only the local transformations over the qubits of the extended receiver.<n>The restored state appears in the superposition with other states which form garbage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose the protocol for perfect state transfer of an arbitrary pure quantum state along the spin-1/2 chain governed by the Hamiltonian preserving the excitation number in the system. We show that the $k$-excitation pure sender's state can be restored at the receiver using only the local transformations over the qubits of the extended receiver. The restored state appears in the superposition with other states which form garbage. This garbage can be easily removed by including the ancilla, whose state labels the garbage, and then measuring the {ancilla state} with desired output. The resulting state of the receiver coincides with the initial sender's state {up to the unimportant common phase factor.} Then, to transfer an arbitrary {pure} state of some system $S_0$, we encode this state into the $k$-excitation state of the sender, transfer and restore this state and finally decode the restored $k$-excitation state {of the receiver} into the state of another subsystem $R_0$. After labeling and removing the garbage via the ancilla-state measuring we complete the algorithm for the perfect transfer of an arbitrary pure state.

Related papers

• Robustness-Runtime Tradeoff for Quantum State Transfer [0.0]
  We introduce the $textitrobustness$ of a state transfer protocol, which quantifies the protocol's tolerance to error in the initial ancilla state.<n>We prove that this tightly bounds the Schatten $p$-norms of these commutators between initial and final-site operators.<n>In conjunction with existing power-law light cones, our result gives new minimum runtimes for partially state-dependent protocols.
  arXiv  Detail & Related papers  (2026-02-25T19:00:01Z)
• Fast high-fidelity baseband reset of a latched state for quantum dot qubit readout [0.0]
  A common method for reading out the state of a spin qubit is by latching one logical qubit state, either $|1rangle$ or $|0rangle$, onto a different, metastable charge state.<n>We demonstrate an on-demand, high fidelity (> 99%) re-initialization of a quantum dot qubit out of a latched readout state.
  arXiv  Detail & Related papers  (2025-10-29T17:08:57Z)
• General detectability measure [53.64687146666141]
  Distinguishing resource states from resource-free states is a fundamental task in quantum information.<n>We derived the optimal exponential decay rate of the failure probability for detecting a given $n$-tensor product state.
  arXiv  Detail & Related papers  (2025-01-16T05:39:22Z)
• Frequency-resolved Purcell effect for the dissipative generation of steady-state entanglement [49.1574468325115]
  We report a driven-dissipative mechanism to generate stationary entangled $W$ states among strongly-interacting quantum emitters placed within a cavity. The non-harmonic energy structure of the interacting ensemble allows this transition to be resonantly selected by the cavity. Evidence of this purely dissipative mechanism should be observable in state-of-the-art cavity QED systems in the solid-state.
  arXiv  Detail & Related papers  (2023-12-19T18:04:22Z)
• When quantum memory is useful for dense coding [45.41082277680607]
  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.
  arXiv  Detail & Related papers  (2023-06-20T02:04:29Z)
• Entanglement and Teleportation in a 1-D Network with Repeaters [2.624902795082451]
  The flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. In this article we investigate how the concurrence of the final entangled state is connected with the concurrences of the initial entangled states present in a 1-D chain. These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.
  arXiv  Detail & Related papers  (2023-06-02T09:53:56Z)
• Accelerating Reinforcement Learning with Value-Conditional State Entropy Exploration [97.19464604735802]
  A promising technique for exploration is to maximize the entropy of visited state distribution. It tends to struggle in a supervised setup with a task reward, where an agent prefers to visit high-value states. We present a novel exploration technique that maximizes the value-conditional state entropy.
  arXiv  Detail & Related papers  (2023-05-31T01:09:28Z)
• State Preparation on Quantum Computers via Quantum Steering [4.169915659794567]
  We demonstrate a state preparation method via measurement-induced steering on contemporary, digital quantum computers. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states. This protocol serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement.
  arXiv  Detail & Related papers  (2023-02-27T04:59:59Z)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• Broadcast of a restricted set of qubit and qutrit states [0.0]
  A qubit confined to the equator of the Bloch sphere can be sent to an arbitrary number of receivers. The entanglement cost is less than that of using teleportation to accomplish the same task. We present a number of variations on this task, probabilistically sending an unknown qubit state to two receivers, sending different qubit states to two receivers, and sending qutrit states to two receivers.
  arXiv  Detail & Related papers  (2022-04-21T17:17:40Z)
• 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)
• Performance of Dense Coding and Teleportation for Random States --Augmentation via Pre-processing [0.8010615606748019]
  We study the dense coding capacity (DCC) and teleportation fidelity (TF) of Haar uniformly generated random multipartite states of various ranks. We observe that the performance of random states for dense coding as well as teleportation decreases with the increase of the rank of states.
  arXiv  Detail & Related papers  (2020-12-10T18:22:46Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

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.