Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.05166

Quantum Sequential Circuits

D. -S. Wang

quant-phcond-mat.mtrl-scics.ARSubmitted Feb 5, 2026• Announced Feb 6, 2026• 1 citation
arXivHTMLPDF

Abstract

This work introduces and characterizes quantum sequential circuits (QSCs) as a hardware-oriented paradigm for quantum computing, built upon a novel foundational element termed the quantum transistor. Unlike conventional qubit-based architectures, QSCs employ symmetry-protected topological junctions where quantum gates are encoded as Choi states via channel-state duality and activated through bulk measurements, utilizing ebits to realize the functional analog of feedback loops in classical sequential circuits. This framework establishes a universal model for quantum computation that inherently incorporates memory and temporal sequencing, complementing existing combinational quantum circuit model. Our work advances the conceptual bridge towards a quantum von Neumann architecture, underscoring the potential of hybrid and modular design principles for the development of large-scale, integrated quantum information processors.

Related papers

Non-Von Neumann Architectures for Quantum Computing Hardware

Jincheng Zhang

This paper proposes a novel approach to quantum computing hardware that diverges from the traditional Von Neumann architecture. The core argument centers around leveraging quantum entanglement and superposition for inherent parallel computation, addressing limitations inherent in the conventional model. We introduce a heterogeneous quantum computing architecture built upon quantum bits (qubits) and quantum circuits, designed to facilitate data processing and control through orchestrated quantum operations. The fundamental innovation lies in moving away from the sequential processing paradigm dictated by Von Neumann architecture, offering a potentially more efficient hardware platform for quantum computations. This architecture aims to unlock significant computational speedups by exploiting the quantum mechanical properties of superposition and entanglement, moving beyond the constraints of classical bit manipulation. The design incorporates a novel control system and qubit connectivity model to maximize computational parallelism. This research contributes to the exploration of alternative hardware designs critical for the advancement of scalable and performant quantum computing systems.

•Sep 3, 2026•0 citations

Towards transistor-based quantum computing

Y. -D. Liu, X. Xu, Q. -R. Wang +1 more

In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with symmetry-protected topological order, hence suppress certain noises and provide high-fidelity Clifford gates without the need for active error correction. This physical protection, quantified by the string order parameters, serves as a low-overhead foundation upon which conventional fault-tolerant encoding (e.g., with stabilizer codes) can be built to achieve universal quantum computation. This architecture shows rich connections with current known architectures, and some desirable merits especially compared with the qubit-based circuits regarding modularity, integration, and program storage. Our study shows that it is plausible to realize it with current technology in the near future.

quant-pharXiv:2605.21045•May 21, 2026•1 citation

A prototype of quantum von Neumann architecture

Dongsheng Wang

Abstract A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. It requires a thorough understanding of the physics of information storage, processing, protection, readout, etc. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far, namely, quantum algorithms are stored and controlled classically, and mainly the executions of them are quantum, leading to the so-called quantum processing units. Such a quantum–classical hybrid is constrained by its classical ingredients, and cannot reveal the computational power of a fully quantum computer system as conceived from the beginning of the field. Recently, the nature of quantum information has been further recognized, such as the no-programming and no-control theorems, and the unifying understandings of quantum algorithms and computing models. As a result, in this work, we propose a model of a universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits (i.e. Bell states) as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. As a digital quantum system, its global configurations can be viewed as tensor-network states. Its universality is proved by the capability to execute quantum algorithms based on a program composition scheme via a universal quantum gate teleportation. It is also protected by the uncertainty principle, the fundamental law of quantum information, making it quantum-secure and distinct from the classical case. In particular, we introduce a few variants of quantum circuits, including the tailed, nested, and topological ones, to characterize the roles of quantum memory and control, which could also be of independent interest in other contexts. In all, our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems in the near future.

arXiv:2112.09345•Communications in Theoretical Physics•Apr 20, 2022•15 citations

Comprehensive Review of Quantum Computing Technologies and Processor Architectures

Babu shanmugham

This paper presents a comprehensive review of quantum computing and the technological foundations of quantum processors. Quantum computing represents a transformative computational paradigm that leverages the fundamental principles of quantum mechanics—such as superposition, entanglement, and quantum interference—to solve complex problems that are intractable for classical computers. At the core of this paradigm lies the quantum processor, a specialized hardware system designed to initialize, control, and measure quantum bits (qubits) through precise gate operations and coherent interactions. The survey examines the essential theoretical concepts underlying quantum computation and provides a structured comparison of leading quantum processor platforms. Prominent architectures, including superconducting circuits, trapped-ion systems, and photonic implementations, are analyzed in terms of their physical mechanisms, scalability, coherence properties, and engineering challenges. Each platform offers distinct advantages and faces specific technical limitations related to noise, error correction, and fabrication complexity. In addition to reviewing hardware developments, this study highlights key obstacles in advancing quantum processors toward large-scale, fault-tolerant systems. Issues such as qubit stability, error mitigation, thermal management, and system integration are discussed to present a realistic perspective on current progress. Performance indicators including gate fidelity, coherence time, connectivity, and scalability are used to compare architectural approaches. The objective of this paper is to provide a clear and organized synthesis of recent advancements in quantum computing hardware, thereby offering researchers and practitioners a foundational reference to support continued innovation and development in this rapidly evolving field.

International Journal of Engineering Development and Research•Mar 1, 2026•0 citations

Implementation of Combinational and Sequential Logic Circuits using Quantum Computing

Neha M Harapanhalli, M Kavipriya, Ishwari Jigajinni +1 more

Quantum computing is an area of computer science that uses the principles of quantum theory. Quantum computing is a booming field and could lead significant advances in various fields, from chemistry to material science to nuclear physics and machine learning. Quantum computing uses quantum bits as a fundamental building block of computations. The power of quantum bits is their ability to scale exponentially, which makes complex computations faster and efficient. The objective of this paper is to design Flip Flops and combinational logic circuits using quantum computing. Flip Flops and combinational circuits assist in complex computations with reduced delay, and high efficiency when designed using quantum computing. The flip flops and adders can henceforth be used in several applications.

International Journal of Scientific Research in Computer Science Engineering and Information Technology•Jun 1, 2023•0 citations

Quantum circuits and parallelism

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.

CRC Press eBooks•Nov 6, 2026•0 citations
This work introduces and characterizes quantum sequential circuits (QSCs) as a hardware-oriented paradigm for quantum computing, built upon a novel foundational element termed the quantum transistor. Unlike conventional qubit-based architectures, QSCs employ symmetry-protected topological junctions where quantum gates are encoded as Choi states via channel-state duality and activated through bulk measurements, utilizing ebits to realize the functional analog of feedback loops in classical sequential circuits. This framework establishes a universal model for quantum computation that inherently incorporates memory and temporal sequencing, complementing existing combinational quantum circuit model. Our work advances the conceptual bridge towards a quantum von Neumann architecture, underscoring the potential of hybrid and modular design principles for the development of large-scale, integrated quantum information processors.
This paper proposes a novel approach to quantum computing hardware that diverges from the traditional Von Neumann architecture. The core argument centers around leveraging quantum entanglement and superposition for inherent parallel computation, addressing limitations inherent in the conventional model. We introduce a heterogeneous quantum computing architecture built upon quantum bits (qubits) and quantum circuits, designed to facilitate data processing and control through orchestrated quantum operations. The fundamental innovation lies in moving away from the sequential processing paradigm dictated by Von Neumann architecture, offering a potentially more efficient hardware platform for quantum computations. This architecture aims to unlock significant computational speedups by exploiting the quantum mechanical properties of superposition and entanglement, moving beyond the constraints of classical bit manipulation. The design incorporates a novel control system and qubit connectivity model to maximize computational parallelism. This research contributes to the exploration of alternative hardware designs critical for the advancement of scalable and performant quantum computing systems.
In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with symmetry-protected topological order, hence suppress certain noises and provide high-fidelity Clifford gates without the need for active error correction. This physical protection, quantified by the string order parameters, serves as a low-overhead foundation upon which conventional fault-tolerant encoding (e.g., with stabilizer codes) can be built to achieve universal quantum computation. This architecture shows rich connections with current known architectures, and some desirable merits especially compared with the qubit-based circuits regarding modularity, integration, and program storage. Our study shows that it is plausible to realize it with current technology in the near future.
Abstract A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. It requires a thorough understanding of the physics of information storage, processing, protection, readout, etc. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far, namely, quantum algorithms are stored and controlled classically, and mainly the executions of them are quantum, leading to the so-called quantum processing units. Such a quantum–classical hybrid is constrained by its classical ingredients, and cannot reveal the computational power of a fully quantum computer system as conceived from the beginning of the field. Recently, the nature of quantum information has been further recognized, such as the no-programming and no-control theorems, and the unifying understandings of quantum algorithms and computing models. As a result, in this work, we propose a model of a universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits (i.e. Bell states) as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. As a digital quantum system, its global configurations can be viewed as tensor-network states. Its universality is proved by the capability to execute quantum algorithms based on a program composition scheme via a universal quantum gate teleportation. It is also protected by the uncertainty principle, the fundamental law of quantum information, making it quantum-secure and distinct from the classical case. In particular, we introduce a few variants of quantum circuits, including the tailed, nested, and topological ones, to characterize the roles of quantum memory and control, which could also be of independent interest in other contexts. In all, our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems in the near future.
This paper presents a comprehensive review of quantum computing and the technological foundations of quantum processors. Quantum computing represents a transformative computational paradigm that leverages the fundamental principles of quantum mechanics—such as superposition, entanglement, and quantum interference—to solve complex problems that are intractable for classical computers. At the core of this paradigm lies the quantum processor, a specialized hardware system designed to initialize, control, and measure quantum bits (qubits) through precise gate operations and coherent interactions. The survey examines the essential theoretical concepts underlying quantum computation and provides a structured comparison of leading quantum processor platforms. Prominent architectures, including superconducting circuits, trapped-ion systems, and photonic implementations, are analyzed in terms of their physical mechanisms, scalability, coherence properties, and engineering challenges. Each platform offers distinct advantages and faces specific technical limitations related to noise, error correction, and fabrication complexity. In addition to reviewing hardware developments, this study highlights key obstacles in advancing quantum processors toward large-scale, fault-tolerant systems. Issues such as qubit stability, error mitigation, thermal management, and system integration are discussed to present a realistic perspective on current progress. Performance indicators including gate fidelity, coherence time, connectivity, and scalability are used to compare architectural approaches. The objective of this paper is to provide a clear and organized synthesis of recent advancements in quantum computing hardware, thereby offering researchers and practitioners a foundational reference to support continued innovation and development in this rapidly evolving field.
Quantum computing is an area of computer science that uses the principles of quantum theory. Quantum computing is a booming field and could lead significant advances in various fields, from chemistry to material science to nuclear physics and machine learning. Quantum computing uses quantum bits as a fundamental building block of computations. The power of quantum bits is their ability to scale exponentially, which makes complex computations faster and efficient. The objective of this paper is to design Flip Flops and combinational logic circuits using quantum computing. Flip Flops and combinational circuits assist in complex computations with reduced delay, and high efficiency when designed using quantum computing. The flip flops and adders can henceforth be used in several applications.
This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.