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:quant-ph/0211175 · Physical Review A

Cyclic networks of quantum gates

Peter Cabauy, Paul A. Benioff

Published Sep 26, 2003• 5 citations
arXivHTMLPDF

Abstract

In this paper initial steps in an analysis of cyclic networks of quantum logic gates will be given. Cyclic networks are those in which the qubit lines are loops. In our investigations of cyclic networks of quantum gates we have studied one- and two-qubit systems plus two-qubit systems connected to another qubit on an acyclic line. The analysis includes classifying networks into groups, the dynamics of the qubits in the cyclic network, and the perturbation effects of an acyclic qubit acting on a cyclic network of quantum gates. This will be followed by a discussion on quantum algorithms and quantum information processing with cyclic networks of quantum gates. An implementation of a cyclic network quantum memory and quantum sensors via cyclic networks will also be discussed.

DOI
10.1103/physreva.68.032315

Related papers

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Multiqubit logic gates in NMR quantum computing

Mark D. Price, Timothy F. Havel, David G. Cory

Much of the current understanding of logic gates for quantum computation relies on the application of one- and two-qubit gates in order to implement a universal set of logic gates, as well as other gates. Such ideas stem from the notion that the Hamiltonians available for quantum computation are one or two-body processes. However, present day NMR implementations of quantum information processing (QIP) rely on the internal Hamiltonian of a liquid state system in which there are many two-body processes that occur simultaneously. Such use of the internal Hamiltonian allows for the creation of `multiqubit' logic gates, i.e. logic gates that operate on many qubits simultaneously and are more efficient than a sequence of one- and two-qubit rotations that effect the same operation. Such larger qubit operations offer a universal set of gates (even when not all couplings within the internal Hamiltonian are readily accessible) as well as more convenient and efficient implementations of the Hadamard transform, the controlled-NOT gate, and a quantum Fourier transform that scales linearly (assuming all couplings can be turned on and off at will).

New Journal of Physics•May 31, 2000•26 citations

Cyclic quantum causal modelling with a graph separation theorem

Carla Ferradini, Victor Gitton, V. Vilasini

Causal modelling frameworks link observable correlations to causal explanations, which is a crucial aspect of science. These models represent causal relationships through directed graphs, with vertices and edges denoting systems and transformations within a theory. Most studies focus on acyclic causal graphs, where well-defined probability rules and powerful graph-theoretic properties like the d-separation theorem apply. However, understanding complex feedback processes and exotic fundamental scenarios with causal loops requires cyclic causal models, where such results do not generally hold. While progress has been made in classical cyclic causal models, challenges remain in uniquely fixing probability distributions and identifying graph-separation properties applicable in general cyclic models. In cyclic quantum scenarios, existing frameworks have focussed on a subset of possible cyclic causal scenarios, with graph-separation properties yet unexplored. This work proposes a framework applicable to all consistent quantum and classical cyclic causal models on finite-dimensional systems. We address these challenges by introducing a robust probability rule and a novel graph-separation property, p-separation, which we prove to be sound and complete for all such models. Our approach maps cyclic causal models to acyclic ones with post-selection, leveraging the post-selected quantum teleportation protocol. We characterize these protocols and their success probabilities along the way. We also establish connections between this formalism and other classical and quantum frameworks to inform a more unified perspective on causality. This provides a foundation for more general cyclic causal discovery algorithms and to systematically extend open problems and techniques from acyclic informational networks (e.g., certification of non-classicality) to cyclic causal structures and networks.

arXiv:2502.04168•Feb 6, 2025•8 citations

Quantum computational networks

David Deutsch

Abstract The theory of quantum computational networks is the quantum generalization of the theory of logic circuits used in classical computing machines. Quantum gates are the generalization of classical logic gates. A single type of gate, the universal quantum gate, together with quantum ‘unit wires’, is adequate for constructing networks with any possible quantum computational property.

Proceedings of the Royal Society of London A Mathematical and Physical Sciences•Sep 8, 1989•1,300 citations

Optically controlled semiconductor spin qubits for quantum information processing

Y. Yamamoto, Thaddeus D. Ladd, David Press +8 more

Implementations of quantum information processing systems based on optically controlled electron spins in semiconductor quantum dots are particulary appealing due to several features. These features include inherent ultrafast gate operation times, reasonably long decoherence times, small optical control power and a natural ability to link to optical fiber communication networks. We will discuss the current state of the art in the experimental implementations of the main elements of semiconductor spin qubits: qubit initialization, single-qubit gates, two-qubit gates, entanglement distribution, projective measurement, quantum memory and indistinguishable single-photon generation.

Physica Scripta•Dec 1, 2009•12 citations

Analysis of quantum gates in quantum circuits

Rongyuan Cui, Zhuyang Lyu

Although classical computing has brought great convenience to mankind’s lives, classical computing is facing some problems. Combining computer science, information theory, and quantum mechanics, quantum information has been developed in many fields. Quantum gates can operate quantum bits, the carrier of quantum information, while quantum circuits are composed of quantum gates and quantum bits, showing the logic of operations. This study summarizes the fundamental concepts of quantum informatics: qubits, quantum circuits, and quantum gates where it is proved that single-bit quantum gates and CNOT gates are universal quantum gates. In addition, this research also demonstrates the current progress of quantum gates in the examination of fidelity of quantum gates, improvement of fidelity of quantum gates, and teleportation of quantum gates. Meanwhile, according to the current development status, the limits and prospects of quantum information are discussed. These results shed light on helping readers understand the basic concepts of quantum information, thus understand the future applications and developments in quantum information.

Theoretical and Natural Science•Nov 16, 2023•3 citations
In this paper initial steps in an analysis of cyclic networks of quantum logic gates will be given. Cyclic networks are those in which the qubit lines are loops. In our investigations of cyclic networks of quantum gates we have studied one- and two-qubit systems plus two-qubit systems connected to another qubit on an acyclic line. The analysis includes classifying networks into groups, the dynamics of the qubits in the cyclic network, and the perturbation effects of an acyclic qubit acting on a cyclic network of quantum gates. This will be followed by a discussion on quantum algorithms and quantum information processing with cyclic networks of quantum gates. An implementation of a cyclic network quantum memory and quantum sensors via cyclic networks will also be discussed.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
Much of the current understanding of logic gates for quantum computation relies on the application of one- and two-qubit gates in order to implement a universal set of logic gates, as well as other gates. Such ideas stem from the notion that the Hamiltonians available for quantum computation are one or two-body processes. However, present day NMR implementations of quantum information processing (QIP) rely on the internal Hamiltonian of a liquid state system in which there are many two-body processes that occur simultaneously. Such use of the internal Hamiltonian allows for the creation of `multiqubit' logic gates, i.e. logic gates that operate on many qubits simultaneously and are more efficient than a sequence of one- and two-qubit rotations that effect the same operation. Such larger qubit operations offer a universal set of gates (even when not all couplings within the internal Hamiltonian are readily accessible) as well as more convenient and efficient implementations of the Hadamard transform, the controlled-NOT gate, and a quantum Fourier transform that scales linearly (assuming all couplings can be turned on and off at will).
Causal modelling frameworks link observable correlations to causal explanations, which is a crucial aspect of science. These models represent causal relationships through directed graphs, with vertices and edges denoting systems and transformations within a theory. Most studies focus on acyclic causal graphs, where well-defined probability rules and powerful graph-theoretic properties like the d-separation theorem apply. However, understanding complex feedback processes and exotic fundamental scenarios with causal loops requires cyclic causal models, where such results do not generally hold. While progress has been made in classical cyclic causal models, challenges remain in uniquely fixing probability distributions and identifying graph-separation properties applicable in general cyclic models. In cyclic quantum scenarios, existing frameworks have focussed on a subset of possible cyclic causal scenarios, with graph-separation properties yet unexplored. This work proposes a framework applicable to all consistent quantum and classical cyclic causal models on finite-dimensional systems. We address these challenges by introducing a robust probability rule and a novel graph-separation property, p-separation, which we prove to be sound and complete for all such models. Our approach maps cyclic causal models to acyclic ones with post-selection, leveraging the post-selected quantum teleportation protocol. We characterize these protocols and their success probabilities along the way. We also establish connections between this formalism and other classical and quantum frameworks to inform a more unified perspective on causality. This provides a foundation for more general cyclic causal discovery algorithms and to systematically extend open problems and techniques from acyclic informational networks (e.g., certification of non-classicality) to cyclic causal structures and networks.
Implementations of quantum information processing systems based on optically controlled electron spins in semiconductor quantum dots are particulary appealing due to several features. These features include inherent ultrafast gate operation times, reasonably long decoherence times, small optical control power and a natural ability to link to optical fiber communication networks. We will discuss the current state of the art in the experimental implementations of the main elements of semiconductor spin qubits: qubit initialization, single-qubit gates, two-qubit gates, entanglement distribution, projective measurement, quantum memory and indistinguishable single-photon generation.
Although classical computing has brought great convenience to mankind’s lives, classical computing is facing some problems. Combining computer science, information theory, and quantum mechanics, quantum information has been developed in many fields. Quantum gates can operate quantum bits, the carrier of quantum information, while quantum circuits are composed of quantum gates and quantum bits, showing the logic of operations. This study summarizes the fundamental concepts of quantum informatics: qubits, quantum circuits, and quantum gates where it is proved that single-bit quantum gates and CNOT gates are universal quantum gates. In addition, this research also demonstrates the current progress of quantum gates in the examination of fidelity of quantum gates, improvement of fidelity of quantum gates, and teleportation of quantum gates. Meanwhile, according to the current development status, the limits and prospects of quantum information are discussed. These results shed light on helping readers understand the basic concepts of quantum information, thus understand the future applications and developments in quantum information.