Spoofing of Quantum Channels Enables Low-Rank Projective Simulation

• URL: http://arxiv.org/abs/2410.14608v1
• Date: Fri, 18 Oct 2024 17:02:46 GMT
• Title: Spoofing of Quantum Channels Enables Low-Rank Projective Simulation
• Authors: Timothy Heightman, Grzegorz Rajchel-Mieldzioć,
• Abstract summary: We show how a Sinkhorn-like algorithm enables us to find the minimum admissible Kraus rank that generates the correct outcome marginals. For a generic $d$-dimensional quantum system, this lowers the Kraus rank from $d2$ to the theoretical minimum of $d$. We numerically demonstrate our findings, for which the code is available and open source.
• Score: 0.0
• License:
• Abstract: The ability to characterise and discern quantum channels is a crucial aspect of noisy quantum technologies. In this work, we explore the problem of distinguishing quantum channels when limited to sub-exponential resources, framed as von Neumann (projective) measurements. We completely characterise equivalence classes of quantum channels with different Kraus ranks that have the same marginal distributions under compatible projective measurements. In doing so, we explicitly identify gauge freedoms which can be varied without changing those compatible marginal outcome distributions, opening new avenues for quantum channel simulation, variational quantum channels, as well as novel adversarial strategies in noisy quantum device certification. Specifically, we show how a Sinkhorn-like algorithm enables us to find the minimum admissible Kraus rank that generates the correct outcome marginals. For a generic $d$-dimensional quantum system, this lowers the Kraus rank from $d^2$ to the theoretical minimum of $d$. For up to $d = 20$, we numerically demonstrate our findings, for which the code is available and open source. Finally, we provide an analytic algorithm for the special case of spoofing Pauli channels.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• 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)
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
  We prove a one-shot quantum covering lemma in terms of smooth min-entropies. We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
  arXiv  Detail & Related papers  (2023-06-21T17:53:22Z)
• 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)
• 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)
• Scalable measures of magic resource for quantum computers [0.0]
  We introduce efficient measures of magic resource for pure quantum states with a sampling cost independent of the number of qubits. We show the transition of classically simulable stabilizer states into intractable quantum states on the IonQ quantum computer.
  arXiv  Detail & Related papers  (2022-04-21T12:50:47Z)
• Stochastic emulation of quantum algorithms [0.0]
  We introduce higher-order partial derivatives of a probability distribution of particle positions as a new object that shares basic properties of quantum mechanical states needed for a quantum algorithm. We prove that the propagation via the map built from those universal maps reproduces up to a prefactor exactly the evolution of the quantum mechanical state. We implement several well-known quantum algorithms, analyse the scaling of the needed number of realizations with the number of qubits, and highlight the role of destructive interference for the cost of emulation.
  arXiv  Detail & Related papers  (2021-09-16T07:54:31Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)

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.