A Quantum Gate Architecture via Teleportation and Entanglement

• URL: http://arxiv.org/abs/2512.04171v1
• Date: Wed, 03 Dec 2025 19:00:05 GMT
• Title: A Quantum Gate Architecture via Teleportation and Entanglement
• Authors: Samuel J. Sheldon, Pieter Kok, Callum W. Duncan,
• Abstract summary: We present a universal quantum computing architecture which combines the measurement-driven aspect of MBQC with the circuit model's algorithm dependent generation of qubit entanglement.<n>Our architecture, which we call QGATE, is tailored for discrete-variable photonic quantum computers with deterministic photon sources capable of generating 1D entangled photonic states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a universal quantum computing architecture which combines the measurement-driven aspect of MBQC with the circuit model's algorithm dependent generation of qubit entanglement. Our architecture, which we call QGATE, is tailored for discrete-variable photonic quantum computers with deterministic photon sources capable of generating 1D entangled photonic states. QGATE achieves universal quantum computing on a logical data qubit register via the implementation of Clifford operations, QGATE ancilla, and arbitrary angle single-qubit measurements. We realise unitary evolutions defined by multi-qubit Pauli strings via the generation of entanglement between a sub-set of logical qubits and a mutual QGATE ancilla qubit. Measurement of the QGATE ancilla in the appropriate basis then implements a given term of the desired unitary operation. This enables QGATE to both directly perform Hamiltonian evolutions in terms of a series of multi-qubit Pauli operators, in terms of projectors for an arbitrary sparse Hamiltonian, or realise multi-controlled gates enabling direct translation of circuit models to QGATE. We consider examples inspired by quantum chemistry and computational fluid dynamics. We propose an example photonic implementation of QGATE and calculate thresholds of $10.36\pm0.02\%$ or $25.98\pm0.28\%$ on the photonic loss for logical qubits constructed from foliated rotated surface codes, dependent on the deployment of intra-layer or inter-layer fusion respectively.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Unitary Coined Discrete-Time Quantum Walks on Directed Multigraphs [1.2183405753834557]
  Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation. Current quantum computers work based on the quantum circuit model of computation.
  arXiv  Detail & Related papers  (2023-04-04T07:19:55Z)
• 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)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Expressive Quantum Perceptrons for Quantum Neuromorphic Computing [1.7636846875530183]
  Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) We propose a building block for QNC architectures, what we call quantum perceptrons (QPs) QPs compute based on the analog dynamics of interacting qubits with tunable coupling constants. We show that QPs are, with restricted resources, a quantum equivalent to the classical perceptron, a simple mathematical model for a neuron.
  arXiv  Detail & Related papers  (2022-11-14T02:50:42Z)
• Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits [0.0]
  We show that applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. Our protocol allows generic quantum circuits to be rotated' in space-time and gives new ways to exchange between resources like qubit number and coherence time in quantum computers.
  arXiv  Detail & Related papers  (2022-09-13T17:46:15Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Deterministic multi-mode gates on a scalable photonic quantum computing platform [0.0]
  We show a small quantum circuit consisting of 10 single-mode gates and 2 two-mode gates on a three-mode input state. On this platform, fault-tolerant universal quantum computing is possible if the cluster state entanglement is improved.
  arXiv  Detail & Related papers  (2020-10-27T16:37:59Z)
• Qudits and high-dimensional quantum computing [4.2066457491320115]
  Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods.
  arXiv  Detail & Related papers  (2020-07-30T22:17:43Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.