Algorithm and Circuit of Nesting Doubled Qubits

• URL: http://arxiv.org/abs/2201.00256v2
• Date: Fri, 7 Jan 2022 18:27:15 GMT
• Title: Algorithm and Circuit of Nesting Doubled Qubits
• Authors: Artyom M. Grigoryan and Sos S. Agaian
• Abstract summary: Copying quantum states is contradictory to classical information processing. This paper investigates the naturally arising question of how well or under what conditions one can copy and measure an arbitrary quantum superposition of states.
• Score: 3.6296396308298795
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Copying the quantum states is contradictory to classical information processing since the fundamental difference between classical and quantum information is that while classical information can be copied perfectly, quantum information cannot. However, this statement does not rule out the risk of building a device that can reproduce a set of quantum states. This paper investigates the naturally arising question of how well or under what conditions one can copy and measure an arbitrary quantum superposition of states. The CNOT and XOR operation-based quantum circuit is presented that exhibits entanglement of states and allows for measuring the doubled qubits.

Related papers

• Data Processing Inequality for The Quantum Guesswork [4.956709222278243]
  Non-orthogonal quantum states cannot be distinguished with absolute certainty. Quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-07-22T19:42:16Z)
• Superselection rules and bosonic quantum computational resources [0.0]
  We identify and classify quantum optical non-classical states as classical/non-classical based on the resources they create on a bosonic quantum computer. Our work contributes to establish a seamless transition from continuous to discrete properties of quantum optics.
  arXiv  Detail & Related papers  (2024-07-03T14:18:41Z)
• Randomly Monitored Quantum Codes [8.557392136621894]
  Recent studies have shown that quantum measurement itself can induce novel quantum phenomena. One example is a monitored random circuit, which can generate long-range entanglement faster than a random unitary circuit. In particular, we demonstrate that for a large class of quantum error-correcitng codes, it is impossible to destroy the encoded information through random single-qubit Pauli measurements.
  arXiv  Detail & Related papers  (2024-01-31T19:53:06Z)
• 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)
• Schr\"odinger cat states of a 16-microgram mechanical oscillator [54.35850218188371]
  The superposition principle is one of the most fundamental principles of quantum mechanics. Here we demonstrate the preparation of a mechanical resonator with an effective mass of 16.2 micrograms in Schr"odinger cat states of motion. We show control over the size and phase of the superposition and investigate the decoherence dynamics of these states.
  arXiv  Detail & Related papers  (2022-11-01T13:29:44Z)
• 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)
• 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)
• Tossing Quantum Coins and Dice [0.0]
  This case is an important example of a quantum procedure because it presents a typical framework employed in quantum information processing and quantum computing. The emphasis is on the clarification of the difference between quantum and classical conditional probabilities.
  arXiv  Detail & Related papers  (2021-03-31T11:39:56Z)
• 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)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

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.