Visually quantifying single-qubit quantum memory

• URL: http://arxiv.org/abs/2312.06939v1
• Date: Tue, 12 Dec 2023 02:17:57 GMT
• Title: Visually quantifying single-qubit quantum memory
• Authors: Wan-Guan Chang, Chia-Yi Ju, Guang-Yin Chen, Yueh-Nan Chen, Huan-Yu Ku
• Abstract summary: We show that all single-qubit quantum memory can be quantified without trusting input state generation. We use the concept of the two-qubit quantum steering ellipsoids to a single-qubit quantum channel and define the channel ellipsoids.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: To store quantum information, quantum memory plays a central intermediate ingredient in a network. The minimal criterion for a reliable quantum memory is the maintenance of the entangled state, which can be described by the non-entanglement-breaking (non-EB) channel. In this work, we show that all single-qubit quantum memory can be quantified without trusting input state generation. In other words, we provide a semi-device-independent approach to quantify all single-qubit quantum memory. More specifically, we apply the concept of the two-qubit quantum steering ellipsoids to a single-qubit quantum channel and define the channel ellipsoids. An ellipsoid can be constructed by visualizing finite output states within the Bloch sphere. Since the Choi-Jamio{\l}kowski state of a channel can all be reconstructed from geometric data of the channel ellipsoid, a reliable quantum memory can be detected. Finally, we visually quantify the single-qubit quantum memory by observing the volume of the channel ellipsoid.

Related papers

• Distributed Quantum Computation via Entanglement Forging and Teleportation [13.135604356093193]
  Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size. In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations.
  arXiv  Detail & Related papers  (2024-09-04T08:10:40Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• 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)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Faithfulness and sensitivity for ancilla-assisted process tomography [0.0]
  A system-ancilla bipartite state capable of containing the complete information of an unknown quantum channel acting on the system is called faithful. We complete the proof of the equivalence and introduce the generalization of faithfulness to various classes of quantum channels.
  arXiv  Detail & Related papers  (2022-06-13T04:19:22Z)
• Quantum Network Tomography with Multi-party State Distribution [10.52717496410392]
  characterization of quantum channels in a quantum network is of paramount importance. We introduce the problem of Quantum Network Tomography. We study this problem in detail for the case of arbitrary star quantum networks with quantum channels described by a single Pauli operator.
  arXiv  Detail & Related papers  (2022-06-06T21:47:09Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum dynamics is not strictly bidivisible [0.0]
  We show that for the qubit, those channels textitdo not exist, whereas for general finite-dimensional quantum channels the same holds at least for full Kraus rank channels. We introduce a novel decomposition of quantum channels which separates them in a boundary and Markovian part, and it holds for any finite dimension.
  arXiv  Detail & Related papers  (2022-03-25T05:20:09Z)
• Heralded entanglement distribution between two absorptive quantum memories [7.245400332036547]
  Experimental demonstration of heralded entanglement between absorptive quantum memories. Quantum repeaters based on absorptive quantum memories can overcome limitations.
  arXiv  Detail & Related papers  (2021-01-13T09:17:10Z)

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.