Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections

• URL: http://arxiv.org/abs/2211.15465v1
• Date: Mon, 28 Nov 2022 15:51:58 GMT
• Title: Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
• Authors: Daniel Litinski and Naomi Nickerson
• Abstract summary: We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits. We show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum computations with thousands of logical qubits, the active volume can be orders of magnitude lower than the circuit volume. Importantly, the architecture does not require all-to-all connectivity between N logical qubits. Instead, each logical qubit is connected to O(log N) other sites. As an example, we show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture without non-local connections. With photonic qubits, long-range connections are available and we show how photonic components can be used to construct a fusion-based active-volume quantum computer.

Related papers

• Quantum resource estimates for computing binary elliptic curve discrete logarithms [0.0]
  We adopt a windowed approach to design our circuit implementation of Shor's algorithm. We provide exact logical gate and qubit counts of our algorithm for cryptographically relevant binary field sizes. We estimate the hardware footprint and runtime of our algorithm executed on surface-code matter-based quantum computers.
  arXiv  Detail & Related papers  (2025-03-04T20:18:50Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers [0.0]
  We propose feasible quantum arithmetic logic units (QALUs) for near-term quantum computers with qubits arranged in two-dimensional arrays. We introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.
  arXiv  Detail & Related papers  (2024-08-13T01:49:58Z)
• Distributed Quantum Computing across an Optical Network Link [0.0]
  We experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. We deterministically teleport a controlled-Z gate between two circuit qubits in separate modules, achieving 86% fidelity. As photons can be interfaced with a variety of systems, this technique has applications extending beyond trapped-ion quantum computers.
  arXiv  Detail & Related papers  (2024-06-30T21:32:10Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• How to fault-tolerantly realize any quantum circuit with local operations [0.0]
  We show how to realize a general quantum circuit involving gates between arbitrary pairs of qubits. We prove that circuit-level local noise modeling is equivalent to local noise in the original circuit.
  arXiv  Detail & Related papers  (2024-02-21T15:12:40Z)
• Logical quantum processor based on reconfigurable atom arrays [27.489364850707926]
  We report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Results herald the advent of early error-corrected quantum computation.
  arXiv  Detail & Related papers  (2023-12-07T01:54:45Z)
• Pipeline quantum processor architecture for silicon spin qubits [0.0]
  Noisy intermediate-scale quantum (NISQ) devices seek to achieve quantum advantage over classical systems. We propose a NISQ processor architecture using a qubit pipeline' in which all run-time control is applied globally. This is achieved by progressing qubit states through a layered physical array of structures.
  arXiv  Detail & Related papers  (2023-06-13T10:35:01Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Entangling logical qubits with lattice surgery [47.037230560588604]
  We show the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information processor. In particular, we demonstrate entanglement between two logical qubits and we implement logical state teleportation.
  arXiv  Detail & Related papers  (2020-06-04T18:00:09Z)

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.