Scalable topological quantum computing based on Sine-Cosine chain models

• URL: http://arxiv.org/abs/2603.25952v1
• Date: Thu, 26 Mar 2026 22:46:37 GMT
• Title: Scalable topological quantum computing based on Sine-Cosine chain models
• Abstract summary: This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains.<n>We describe how these chains can be used in Y-junction braiding protocols for gate operations and in extended memory architectures capable of storing multiple qubits simultaneously.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains. These chains support high-dimensional qudit encoding within single systems, reducing the physical resource overhead compared to conventional qubit arrays. We describe how these chains can be used in Y-junction braiding protocols for gate operations and in extended memory architectures capable of storing multiple qubits simultaneously. Fidelity analysis shows partial topological protection against disorder, suggesting this approach is a possible pathway toward low-overhead quantum hardware.

Related papers

• Truncated hybrid tensor networks for distributed quantum simulation [18.12647541043629]
  Current protocols such as circuit knitting incur a quasi-probability sampling cost that grows exponentially with the number of remote gates across the cut.<n>We present a truncated hybrid tensor network (THTN) framework in which a remote two-body gate is applied as a sum of local unitaries on the subsystems.<n>We validate this distributed protocol by classical simulation against time-evolving block decimation (TEBD) at the same bond dimension.
  arXiv  Detail & Related papers  (2026-09-15T02:09:46Z)
• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• Structured Unitary Tensor Network Representations for Circuit-Efficient Quantum Data Encoding [33.951713386684425]
  TNQE is a circuit-efficient quantum data encoding framework built on structured unitary tensor network representations.<n> TNQE compiles the resulting tensor cores into an encoding circuit through two complementary core-to-circuit strategies.<n>Across a range of benchmarks, TNQE achieves encoding circuits as shallow as $0.04times$ the depth of amplitude encoding.
  arXiv  Detail & Related papers  (2026-02-18T08:36:07Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• Roadmap to fault tolerant quantum computation using topological qubit arrays [36.987470905062736]
  We describe a device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits.<n>Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; and an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits.
  arXiv  Detail & Related papers  (2025-02-17T19:00:10Z)
• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• 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)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Entanglement from tensor networks on a trapped-ion QCCD quantum computer [2.943524728957949]
  We experimentally demonstrate a significant benefit of this approach to quantum simulation. In addition to all correlation functions, the entanglement structure of an infinite system is conveniently encoded within a small register of "bond qubits" We quantitatively determine the near-critical entanglement entropy of a correlated spin chain directly in the thermodynamic limit.
  arXiv  Detail & Related papers  (2021-04-22T18:00:00Z)
• Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation [0.0]
  Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
  arXiv  Detail & Related papers  (2020-08-08T15:34:03Z)

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.