A Localized Reality Appears To Underpin Quantum Circuits

• URL: http://arxiv.org/abs/2412.05456v1
• Date: Fri, 06 Dec 2024 22:35:45 GMT
• Title: A Localized Reality Appears To Underpin Quantum Circuits
• Authors: Ken Wharton, Roderick Sutherland, Titus Amza, Raylor Liu, James Saslow,
• Abstract summary: We present evidence for a localized account of any quantum circuit's behavior.<n>Even if the state is massively entangled, the weak values are found to evolve only when they pass through a local circuit element.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Although entangled state vectors cannot be described in terms of classically realistic variables, localized in space and time, any given entanglement experiment can be built from basic quantum circuit components with well-defined locations. By analyzing the (local) weak values for any given run of a quantum circuit, we present evidence for a localized account of any circuit's behavior. Specifically, even if the state is massively entangled, the weak values are found to evolve only when they pass through a local circuit element. They otherwise remain constant and do not evolve when other qubits pass through their circuit elements. A further surprise is found when two qubits are brought together in an exchange interaction, as their weak values then evolve according to a simple classical equation. The weak values are subject to both past and future constraints, so they can only be determined by considering the entire circuit "all-at-once", as in action principles. In the context of a few basic quantum gates, we show how an all-at-once model of a complete circuit could generate weak values without using state vectors as an intermediate step. Since these gates comprise a universal quantum gate set, this lends support to the claim that any quantum circuit can plausibly be underpinned by localized variables, providing a realistic, lower-level account of generic quantum systems.

Related papers

• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer. Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Minimal Equational Theories for Quantum Circuits [44.99833362998488]
  We show that any true equation on quantum circuits can be derived from simple rules. One of our main contributions is to prove the minimality of the equational theory.
  arXiv  Detail & Related papers  (2023-11-13T17:11:25Z)
• Absence of barren plateaus in finite local-depth circuits with long-range entanglement [3.6343650965508187]
  shallow parameterized circuits can be effectively trained to obtain short-range entangled states. Deep circuits are generally untrainable due to the barren plateau phenomenon. We prove the absence of barren plateaus in training finite local-depth circuits.
  arXiv  Detail & Related papers  (2023-11-02T16:53:23Z)
• Universal quantum computation using atoms in cross-cavity systems [0.0]
  We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup. Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
  arXiv  Detail & Related papers  (2023-08-28T20:09:54Z)
• Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective [39.58317527488534]
  We develop a framework to characterize the separability of a specific type of one-dimensional quasiparticle known as a fermionic anyon. We map this notion of fermionic-anyon separability to the free resources of matchgate circuits. We also identify how entanglement between two qubits encoded in a dual-rail manner, as standard for matchgate circuits, corresponds to the notion of entanglement between fermionic anyons.
  arXiv  Detail & Related papers  (2023-06-01T15:25:19Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• Non-local finite-depth circuits for constructing SPT states and quantum cellular automata [0.24999074238880484]
  We show how to implement arbitrary translationally invariant quantum cellular automata in any dimension using finite-depth circuits of $k$-local gates. Our results imply that the topological classifications of SPT phases and QCA both collapse to a single trivial phase in the presence of $k$-local interactions.
  arXiv  Detail & Related papers  (2022-12-13T19:00:00Z)
• 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)
• A Complete Equational Theory for Quantum Circuits [58.720142291102135]
  We introduce the first complete equational theory for quantum circuits. Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
  arXiv  Detail & Related papers  (2022-06-21T17:56:31Z)
• Steered discrete-time quantum walks for engineering of quantum states [0.0]
  We analyze the strengths and limitations of steered discrete time quantum walks in generating quantum states of bipartite quantum systems. We show that not all quantum states in the composite space are accessible through quantum walks, even under the most generalized definition of a quantum step.
  arXiv  Detail & Related papers  (2022-05-10T13:14:25Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Quantum Circuits in Additive Hilbert Space [0.0]
  We show how conventional circuits can be expressed in the additive space and how they can be recovered. In particular in our formalism we are able to synthesize high-level multi-controlled primitives from low-level circuit decompositions. Our formulation also accepts a circuit-like diagrammatic representation and proposes a novel and simple interpretation of quantum computation.
  arXiv  Detail & Related papers  (2021-11-01T19:05:41Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• 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.