Can the quantum switch be deterministically simulated?

• URL: http://arxiv.org/abs/2409.18202v1
• Date: Thu, 26 Sep 2024 18:34:14 GMT
• Title: Can the quantum switch be deterministically simulated?
• Authors: Jessica Bavaresco, Satoshi Yoshida, Tatsuki Odake, Hlér Kristjánsson, Philip Taranto, Mio Murao, Marco Túlio Quintino,
• Abstract summary: We show that when only one extra call of each input channel is available, the quantum switch cannot be simulated by any quantum circuit. This result stands in stark contrast with the known fact that, when the quantum switch acts exclusively on unitary channels, its action can be simulated.
• Score: 1.151731504874944
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Higher-order transformations that act on a certain number of input quantum channels in an indefinite causal order - such as the quantum switch - cannot be described by standard quantum circuits that use the same number of calls of the input quantum channels. However, the question remains whether they can be simulated, i.e., whether their action on their input channels can be deterministically reproduced, for all arbitrary inputs, by a quantum circuit that uses a larger number of calls of the input channels. Here, we prove that when only one extra call of each input channel is available, the quantum switch cannot be simulated by any quantum circuit. We demonstrate that this result is robust by showing that, even when probabilistic and approximate simulations are considered, higher-order transformations that are close to the quantum switch can be at best simulated with a probability strictly less than one. This result stands in stark contrast with the known fact that, when the quantum switch acts exclusively on unitary channels, its action can be simulated.

Related papers

• Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits [1.151731504874944]
  We prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically. This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.
  arXiv  Detail & Related papers  (2024-09-27T03:18:28Z)
• Fundamental limitations on the recoverability of quantum processes [0.6990493129893111]
  We determine fundamental limitations on how well the physical transformation on quantum channels can be undone or reversed. We refine (strengthen) the quantum data processing inequality for quantum channels under the action of quantum superchannels. We also provide a refined inequality for the entropy change of quantum channels under the action of an arbitrary quantum superchannel.
  arXiv  Detail & Related papers  (2024-03-19T17:50:24Z)
• 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)
• Quantum Routing for Emerging Quantum Networks [0.0]
  Quantum routing, the entanglement of an input quantum signal over multiple output paths, will be an important aspect of future quantum networks. We design a combined circuit for quantum routing and quantum error correction, and carry out the first implementation of such a circuit on a noisy real-world quantum device. Our experiments validate, for the first time, that error-corrected quantum routing in near-term noisy quantum-computing devices is feasible.
  arXiv  Detail & Related papers  (2022-11-11T08:58:29Z)
• Quantum communication using a quantum switch of quantum switches [13.939388417767136]
  We show that two quantum switches placed in a quantum superposition of their alternative orders can transmit a qubit, without any error, with a probability higher than that achievable with the quantum switches individually. We also show that there are situations where there is no communication advantage over the individual quantum switches.
  arXiv  Detail & Related papers  (2021-11-16T07:31:58Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Consequences of preserving reversibility in quantum superchannels [4.014524824655106]
  Quantum superchannels with multiple slots are deterministic transformations which take independent quantum operations as inputs. We show that the reversibility preserving condition restricts all pure superchannels with two slots to be either a quantum circuit only consisting of unitary operations or a coherent superposition of two unitary quantum circuits.
  arXiv  Detail & Related papers  (2020-03-12T09:46:46Z)

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.