Self-protected adiabatic quantum computation

• URL: http://arxiv.org/abs/2203.09695v1
• Date: Fri, 18 Mar 2022 01:52:48 GMT
• Title: Self-protected adiabatic quantum computation
• Authors: P. V. Pyshkin, Da-Wei Luo and Lian-Ao Wu
• Abstract summary: We study the possibility of quantum computation in decoherence free subspace. This passive protection protocol can be especially advantageous for continuous quantum computation.
• Score: 0.6445605125467573
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive protection protocol can be especially advantageous for continuous quantum computation such as quantum annealers. As an example we propose to use decoherence protected adiabatic quantum computation for the Grover search problem. Our proposal contains only two-body interactions, making it feasible in near-term quantum devices.

Related papers

• Quantum decoherence from complex saddle points [0.0]
  Quantum decoherence is the effect that bridges quantum physics to classical physics. We present some first-principle calculations in the Caldeira-Leggett model. We also discuss how to extend our work to general models by Monte Carlo calculations.
  arXiv  Detail & Related papers  (2024-08-29T15:35:25Z)
• 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)
• Suppressing decoherence in quantum state transfer with unitary operations [1.9662978733004601]
  We study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment and in a real experiment with a cloud-accessible quantum processor.
  arXiv  Detail & Related papers  (2022-08-09T17:41:20Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum Computation Using Action Variables [4.087043981909747]
  We argue quantum computation using action variables as fault-tolerant quantum computation, whose fault-tolerance is guaranteed by the quantum KAM theorem. Besides, we view the Birkhoff norm form as a mathematical framework of the extended harmonic oscillator quantum computation.
  arXiv  Detail & Related papers  (2021-09-24T12:04:27Z)
• 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)
• Implementation of hybridly protected quantum gates [2.3274138116397727]
  We explore the implementation of hybridly protected quantum operations based on a simple and experimentally achievable spin model. The protected quantum operations are controllable, well-suited for resolving various quantum tasks. Our scheme is based on experimentally achievable Hamiltonian with reduced requirement of computational resources.
  arXiv  Detail & Related papers  (2021-05-11T10:04:02Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)

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.