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

Elsevier eBooks

Quantum Logical Diagram of Quantum Computing Evolution

Hideaki Matsueda, David W. Cohen

Published Jan 1, 1999• 1 citation
Publisher
DOI
10.1016/b978-044450091-5/50010-5

Related papers

Decision Diagrams for Quantum Computing

Robert Wille, Stefan Hillmich, Lukas Burgholzer

arXiv:2302.04687•Springer eBooks•Aug 13, 2022•25 citations

Computer-aided-design methods for emerging quantum computing technologies

Mitchell Aaron Thornton, David Y. Feinstein

Emerging quantum computing technologies are poised to replace standard CMOS logic when the exponential size reduction reaches sub-atomic dimensions. Quantum circuits are reversible and therefore promise the potential of computation without energy loss. This research considers computer aided design (CAD) methods for all major aspects of quantum computing circuit design including logic synthesis, simulation, verification, and testing. The technologies we investigate include quantum cell automata (QCA) and general quantum circuits (QC), with significantly more emphasis on the later. The recently introduced quantum multi-valued decision diagram (QMDD) provides an efficient method to represent and simulate quantum (and other classical reversible) circuits. A major contribution of this dissertation is the development of a sift-like minimization as well as structure metrics based minimization techniques for QMDD. We have used the enhanced QMDD to efficiently simulate quantum circuits as well as quantum vectors. Our early investigation of reversible logic is concerned with a virtual implementation that uses a direct translation of relatively complex binary functions into circuits composed of Fredkin reversible gates. This allowed us to project size and speed complexity of complex reversible circuits, although this direct translation approach fails to minimize garbage inputs and outputs. To achieve proper garbage minimization, one must synthesize reversible logic using gate cascades with appropriate optimization methods embedded that attempt to minimize the total number of lines in the circuit. To that end, we developed a novel QMDD-based tool for cascade logic synthesis that utilizes the QMDD minimized variable order for lexicographical synthesis with garbage minimization included as an optimization criterion. We developed a synthesis tool that investigates the QCA native 3-input majority gates ability to implement complex logic circuits. In particular, we explore the benefit of transforming the logic description into exclusive sum of products (ESOP) forms prior to implementation in the majority gates. We survey recent efforts in establishing the foundation for QC testing and fault tolerant QC. We project the potential use of random tests as well as built in self test (BIST) techniques for future QC. A major contribution of this dissertation is the investigation of partially redundant reversible logic. Detection of partially redundant logic within any design, reversible or irreversible, has ramifications for logic synthesis, for design verification, and for design for test (DFT) issues.

•Jan 1, 2008•3 citations

Spacetime Layout and Logical Compilation of Color Code

Qinjing Yu, Ke Liu

Fault-tolerant quantum computing requires system-level coordination of logical primitives. Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations. Based on its anyon-condensation and domain-wall structure, we introduce a spacetime block-diagram representation capturing logical patches and operations and derive the rules governing block assembly. A correspondence with ZX diagrams further identifies the logical semantics of this representation and enables transformations that preserve the represented computation. Moreover, we develop a code-derived compilation strategy that converts ZX representations of logical computations into valid color-code spacetime layouts. In this strategy, edge-decorated ZX diagrams tailor the logical representation to the color code under the block-assembly constraints, and fusion-region-aware routing exploits semantic equivalence during geometric embedding. We automate the complete logical compilation process and demonstrate successful compilation across a broad range of algorithms. Our work advances color-code architecture from individual primitives to the automated synthesis of logical computations, marking a significant step toward its full-stack quantum computing.

quant-pharXiv:2607.28504•Jul 31, 2026•0 citations

APPLICATION OF DECISION DIAGRAMS TO DESIGN QUANTUM LOGIC CIRCUITS

Joyshree Nath, Asoke Nath

Quantum computing is the theory of quantum bits, or qubits, and their associated linear transformations. A quantum computer is more powerful than classical computers, with the problems being solvable. Quantum computing is expected to play an increasingly important role in building more compact and less power-consuming computers. Quantum Computing has emerged to be a very effective field where numerous scientists are doing research in this area. It is true that quantum computing system is now in its initial theoretical state, a lot of aspects of this logic has been proposed by scientists over the years. Quantum computing promises to compute a whole set of intractable problems easily and within a very small amount of time. From binary to multi-valued logic quantum computing systems have a lot of properties to be explored, but mainly theoretically and not in a form of some tangible hardware logic. In the present study the authors have made a thorough study of the properties of binary and multi-valued quantum logic along with the impact of Quantum Information Decision Diagram (QUIDD), Quantum Multi-Valued Decision Diagrams in quantum logic.

Journal of Global Research in Computer Sciences•Apr 7, 2012•0 citations

Quantum logic and quantum computation

Mladen Pavičić, Norman D. Megill

Elsevier eBooks•Jan 1, 2007•16 citations

Quantum Logic for Quantum Computers

Mladen Pavičić

International Journal of Theoretical Physics•Mar 1, 2000•1 citation
Emerging quantum computing technologies are poised to replace standard CMOS logic when the exponential size reduction reaches sub-atomic dimensions. Quantum circuits are reversible and therefore promise the potential of computation without energy loss. This research considers computer aided design (CAD) methods for all major aspects of quantum computing circuit design including logic synthesis, simulation, verification, and testing. The technologies we investigate include quantum cell automata (QCA) and general quantum circuits (QC), with significantly more emphasis on the later. The recently introduced quantum multi-valued decision diagram (QMDD) provides an efficient method to represent and simulate quantum (and other classical reversible) circuits. A major contribution of this dissertation is the development of a sift-like minimization as well as structure metrics based minimization techniques for QMDD. We have used the enhanced QMDD to efficiently simulate quantum circuits as well as quantum vectors. Our early investigation of reversible logic is concerned with a virtual implementation that uses a direct translation of relatively complex binary functions into circuits composed of Fredkin reversible gates. This allowed us to project size and speed complexity of complex reversible circuits, although this direct translation approach fails to minimize garbage inputs and outputs. To achieve proper garbage minimization, one must synthesize reversible logic using gate cascades with appropriate optimization methods embedded that attempt to minimize the total number of lines in the circuit. To that end, we developed a novel QMDD-based tool for cascade logic synthesis that utilizes the QMDD minimized variable order for lexicographical synthesis with garbage minimization included as an optimization criterion. We developed a synthesis tool that investigates the QCA native 3-input majority gates ability to implement complex logic circuits. In particular, we explore the benefit of transforming the logic description into exclusive sum of products (ESOP) forms prior to implementation in the majority gates. We survey recent efforts in establishing the foundation for QC testing and fault tolerant QC. We project the potential use of random tests as well as built in self test (BIST) techniques for future QC. A major contribution of this dissertation is the investigation of partially redundant reversible logic. Detection of partially redundant logic within any design, reversible or irreversible, has ramifications for logic synthesis, for design verification, and for design for test (DFT) issues.
Fault-tolerant quantum computing requires system-level coordination of logical primitives. Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations. Based on its anyon-condensation and domain-wall structure, we introduce a spacetime block-diagram representation capturing logical patches and operations and derive the rules governing block assembly. A correspondence with ZX diagrams further identifies the logical semantics of this representation and enables transformations that preserve the represented computation. Moreover, we develop a code-derived compilation strategy that converts ZX representations of logical computations into valid color-code spacetime layouts. In this strategy, edge-decorated ZX diagrams tailor the logical representation to the color code under the block-assembly constraints, and fusion-region-aware routing exploits semantic equivalence during geometric embedding. We automate the complete logical compilation process and demonstrate successful compilation across a broad range of algorithms. Our work advances color-code architecture from individual primitives to the automated synthesis of logical computations, marking a significant step toward its full-stack quantum computing.
Quantum computing is the theory of quantum bits, or qubits, and their associated linear transformations. A quantum computer is more powerful than classical computers, with the problems being solvable. Quantum computing is expected to play an increasingly important role in building more compact and less power-consuming computers. Quantum Computing has emerged to be a very effective field where numerous scientists are doing research in this area. It is true that quantum computing system is now in its initial theoretical state, a lot of aspects of this logic has been proposed by scientists over the years. Quantum computing promises to compute a whole set of intractable problems easily and within a very small amount of time. From binary to multi-valued logic quantum computing systems have a lot of properties to be explored, but mainly theoretically and not in a form of some tangible hardware logic. In the present study the authors have made a thorough study of the properties of binary and multi-valued quantum logic along with the impact of Quantum Information Decision Diagram (QUIDD), Quantum Multi-Valued Decision Diagrams in quantum logic.