Counterfactual universal quantum computation

• URL: http://arxiv.org/abs/2011.07195v1
• Date: Sat, 14 Nov 2020 02:16:49 GMT
• Title: Counterfactual universal quantum computation
• Authors: Zhu Cao
• Abstract summary: We show that universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. Our work has practical applications to color imaging of ancient arts, upon which light is forbidden to shine.
• Score: 1.3706331473063877
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes. To ease practical implementation, we analyze counterfactual universal quantum computation with realistic devices, including the effects of finite execution time, photon loss, and atom missing. Besides the theoretical interest of illustrating the mysterious and counterintuitive nature of quantum physics, our work has practical applications to color imaging of ancient arts, upon which light is forbidden to shine.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• 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)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• Probing the limits of quantum theory with quantum information at subnuclear scales [0.13844779265721088]
  We propose a new theoretical framework of Q-data tests. It recognises the established validity of quantum theory, but allows for more general -- 'post-quantum' -- scenarios in certain physical regimes.
  arXiv  Detail & Related papers  (2021-03-22T16:47:39Z)
• Continuous Variable Quantum Advantages and Applications in Quantum Optics [0.0]
  This thesis focuses on three main questions in the continuous variable and optical settings. Where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? What advantages can be gained in practice from the use of quantum information?
  arXiv  Detail & Related papers  (2021-02-10T02:43:27Z)
• 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)
• High-efficiency arbitrary quantum operation on a high-dimensional quantum system [7.921557303547302]
  The ultimate goal of quantum control is to realize arbitrary quantum operations (AQuOs) for all possible open quantum system dynamics. Here, we experimentally demonstrate a universal approach of AQuO on a photonic qudit with minimum physical resource of a two-level ancilla and a $log_2d$-scale circuit depth. The AQuO is then applied in quantum trajectory simulation for quantum subspace stabilization and quantum Zeno dynamics, as well as incoherent manipulation and generalized measurements of the qudit.
  arXiv  Detail & Related papers  (2020-10-22T04:01:03Z)
• Do qubits dream of entangled sheep? Quantum measurement without classical output [0.0]
  We introduce an entirely quantum notion of measurement, called a sensation, to account for quantum agents that experience the world through quantum sensors. Sensations eschew probabilities and instead describe a deterministic flow of quantum information.
  arXiv  Detail & Related papers  (2020-08-24T18:00:11Z)
• Operational Resource Theory of Imaginarity [48.7576911714538]
  We show that quantum states are easier to create and manipulate if they only have real elements. As an application, we show that imaginarity plays a crucial role for state discrimination.
  arXiv  Detail & Related papers  (2020-07-29T14:03:38Z)

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.