Multitime Quantum Communication: Interesting But Not Counterfactual

• URL: http://arxiv.org/abs/2301.01730v3
• Date: Wed, 28 Jun 2023 20:18:32 GMT
• Title: Multitime Quantum Communication: Interesting But Not Counterfactual
• Authors: Robert B. Griffiths
• Abstract summary: Protocol for transmission of information between two parties introduced by Salih et al., Phys. Rev. Lett. 110 (2013) 170502 (hereafter SLAZ), involves sending quantum amplitude back and forth through a quantum channel in a series of steps. Authors claimed that their protocol was counterfactual'' in the sense that while a quantum channel is needed to connect the parties, its actual usage becomes vanishingly small in the limit as the number of steps tends to infinity. Here we show that this claim is incorrect because it uses probabilistic reasoning that is not valid at intermediate times in the presence of quantum interference
• Score: 3.8073142980733
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: A protocol for transmission of information between two parties introduced by Salih et al., Phys. Rev. Lett. 110 (2013) 170502 (hereafter SLAZ), involves sending quantum amplitude back and forth through a quantum channel in a series of steps, rather than simply sending a signal in one direction. The authors claimed that their protocol was ``counterfactual'' in the sense that while a quantum channel is needed to connect the parties, its actual usage becomes vanishingly small in the asymptotic limit as the number of steps tends to infinity. Here we show that this claim is incorrect because it uses probabilistic reasoning that is not valid at intermediate times in the presence of quantum interference. When ill-defined probabilities are replaced with a well-defined measure of channel usage here called ``Cost'', equal to the absolute square of the amplitude sent through the channel, the total Cost does not go to zero in the asymptotic limit of a large number of steps, but is bounded below by a rigorous inequality. A detailed analysis shows that this bound is satisfied in the SLAZ protocol. The analysis leading to the bound uses the fact that the Gram matrix formed by inner products of a collection of pure quantum states is additive over Hilbert subspaces and invariant under unitary time transformations. Its off-diagonal elements, which in general are not positive, play a significant role in the formal argument as well as providing a somewhat strange way of visualizing the transfer of information.

Related papers

• Hidden-State Proofs of Quantumness [1.0878040851638]
  An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests. We present a proof of quantumness which maintains the same circuit structure as (Brakerski et al.)
  arXiv  Detail & Related papers  (2024-10-08T21:04:53Z)
• Contraction of unitary operators, quantum graphs and quantum channels [0.0]
  Given a unitary operator in a finite dimensional complex Hilbert space, its unitary contraction to a subspace is defined. The application to quantum graphs is discussed. The contraction of quantum channels is also defined.
  arXiv  Detail & Related papers  (2024-07-28T16:51:54Z)
• Protocol for nonlinear state discrimination in rotating condensate [0.0]
  mean field dynamics enables quantum information processing operations that are impossible in linear one-particle quantum mechanics. A nice feature of the protocol is that only readout of individual quantized circulation states (not superpositions) is required.
  arXiv  Detail & Related papers  (2024-04-25T02:18:34Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
  A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438]. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel. This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
  arXiv  Detail & Related papers  (2022-01-23T13:05:36Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Tightening the tripartite quantum memory assisted entropic uncertainty relation [0.0]
  In quantum information theory, Shannon entropy has been used as an appropriate measure to express the uncertainty relation. One can extend the bipartite quantum memory assisted entropic uncertainty relation to tripartite quantum memory assisted uncertainty relation.
  arXiv  Detail & Related papers  (2020-05-05T12:51:25Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.