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

Physical Review A

Bell states in a resonant quantum waveguide network

Gürsoy B. Akgüç, L. E. Reichl, Anil Shaji, Michael G. Snyder

Published Apr 5, 2004• 22 citations
Publisher

Abstract

We show that a network of ballistic electron waveguides can generate entangled Bell-like states from separable states when it is resonant. The network we study is grouped into individual qudits $(d=4)$ made up of pairs of waveguides. Rotation gates in the network produce coherent superpositions of qudit states. A Coulomb gate entangles the qudits. We construct a unitary matrix which characterizes the network dynamics and allows a more systematic study of that dynamics.

DOI
10.1103/physreva.69.042303

Related papers

Coulomb entangler and entanglement-testing network for waveguide qubits

L. E. Reichl, Michael G. Snyder

We present a small network for the testing of the entanglement of two ballistic electron waveguide qubits. The network produces different output conditional on the presence or absence of entanglement. The structure of the network allows for the determination of successful entanglement operations through the measurement of the output of a single qubit. We also present a simple model of a dynamic Coulomb-like interaction and use it to describe some characteristics of a proposed scheme for the entanglement of qubits in ballistic electron waveguides.

arXiv:quant-ph/0509043•Physical Review A•Sep 26, 2005•12 citations

Ballistic electron waveguide adder

Michael G. Snyder, L. E. Reichl

We analyze a quantum network, constructed with ballistic electron waveguides, which can add one-bit binary numbers. We consider two different adder networks, one constructed with Hadamard gates and the other constructed with $\sqrt{\mathrm{NOT}}$ gates. Reflection of electron probability at the gates causes a loss in fidelity of the overall calculation. A fidelity requirement for the implementation of individual rotation gates corresponding to a probability $p>1∕2$ of completing the addition successfully is found.

Physical Review A•Nov 30, 2004•16 citations

Distribution of Bell State Entanglement in Qubit Networks via Collision Models

Elif Yunt, Mert Doğan, Öner Faruk Ödemiş +1 more

We investigate the selective generation of Bell-pair entanglement in three qubit networks using a standard quantum collision model. By varying the network geometry, the node contacted by the ancilla, and the interaction Hamiltonians, we identify configurations in which high pairwise concurrence and Bell state fidelity are generated between different target qubits, including nonadjacent qubits and qubits not directly coupled to the ancilla. For comparison, we also consider the continuous time unitary evolution of the complete ancilla network system, sampled at the same discrete time intervals. This reference calculation clarifies how discarding each outgoing ancilla and removing its correlations from subsequent dynamics modifies the attainable entanglement and preparation time. Our results provide a proof of principle demonstration of geometry dependent Bell pair generation and routing in small qubit networks.

quant-pharXiv:2604.01773•Physics Letters A•Apr 3, 2026•0 citations

Quantum computation with ballistic electron waveguides

Michael G. Snyder

We present a study of ballistic electron waveguides as used to construct simple \nquantum computational networks. We begin with an introduction to ballistic \nelectron waveguides, some basic theory of quantum computers, and the \npossible role of electron waveguides in quantum computation. Following that, \nour study of various waveguide networks and the physics of the specific components \nof those networks. We continue with a discussion of shot noise in \nnetwork elements and its possible role in helping to build good computational \ngates. Finally we conclude with a summary of research and possible future \nprojects.

•Jan 1, 2006•0 citations

Entanglement Generation via Spatial Path Superposition

Rajiuddin Sk, Claudio Pellitteri, Marcello Caleffi +1 more

Entanglement generation and distribution is a core functionality of quantum networks. Traditional approaches to this functionality rely on chains of quantum repeaters or on manipulation of multipartite states. In this work, we explore an alternative paradigm that explores quantum coherence at propagation level, by enabling genuine quantum instantiations of communication channels, existing in superposed configurations. We demonstrate that this mechanism can be harnessed to generate both bipartite and multipartite entangled states from separable inputs. Specifically, we show that Bell states can be obtained from initially separable two-qubit states, through the superposition of two unitary quantum channels. The proposed approach is further extended to multipartite systems, by generating n-qubit GHZ and W states and thereby revealing the constructive role of superposed quantum operations in entanglement creation. Moreover, we analyze the robustness of the proposed scheme against noise, showing that the resulting states retain high fidelity and concurrence even under realistic imperfections. Our results suggest that, under appropriate quantum control, noisy superposed paths can be effectively harnessed to engineer entanglement generation and distribution in quantum networks.

•Jan 18, 2026•0 citations

Entangled Quantum Networks

Fariel Shafee

We present some results from simulation of a network of nodes connected by c-NOT gates with nearest neighbors. Though initially we begin with pure states of varying boundary conditions, the updating with time quickly involves a complicated entanglement involving all or most nodes. As a normal c-NOT gate, though unitary for a single pair of nodes, seems to be not so when used in a network in a naive way, we use a manifestly unitary form of the transition matrix with c?-NOT gates, which invert the phase as well as flipping the qubit. This leads to complete entanglement of the net, but with variable coefficients for the different components of the superposition. It is interesting to note that by a simple logical back projection the original input state can be recovered in most cases. We also prove that it is not possible for a sequence of unitary operators working on a net to make it move from an aperiodic regime to a periodic one, unlike some classical cases where phase-locking happens in course of evolution. However, we show that it is possible to introduce by hand periodic orbits to sets of initial states, which may be useful in forming dynamic pattern recognition systems.

arXiv:quant-ph/0203010•Mar 4, 2002•8 citations
We show that a network of ballistic electron waveguides can generate entangled Bell-like states from separable states when it is resonant. The network we study is grouped into individual qudits (d=4)(d=4)(d=4) made up of pairs of waveguides. Rotation gates in the network produce coherent superpositions of qudit states. A Coulomb gate entangles the qudits. We construct a unitary matrix which characterizes the network dynamics and allows a more systematic study of that dynamics.
We present a small network for the testing of the entanglement of two ballistic electron waveguide qubits. The network produces different output conditional on the presence or absence of entanglement. The structure of the network allows for the determination of successful entanglement operations through the measurement of the output of a single qubit. We also present a simple model of a dynamic Coulomb-like interaction and use it to describe some characteristics of a proposed scheme for the entanglement of qubits in ballistic electron waveguides.
We analyze a quantum network, constructed with ballistic electron waveguides, which can add one-bit binary numbers. We consider two different adder networks, one constructed with Hadamard gates and the other constructed with NOT\sqrt{\mathrm{NOT}}NOT​ gates. Reflection of electron probability at the gates causes a loss in fidelity of the overall calculation. A fidelity requirement for the implementation of individual rotation gates corresponding to a probability p>1∕2p>1∕2p>1∕2 of completing the addition successfully is found.
We investigate the selective generation of Bell-pair entanglement in three qubit networks using a standard quantum collision model. By varying the network geometry, the node contacted by the ancilla, and the interaction Hamiltonians, we identify configurations in which high pairwise concurrence and Bell state fidelity are generated between different target qubits, including nonadjacent qubits and qubits not directly coupled to the ancilla. For comparison, we also consider the continuous time unitary evolution of the complete ancilla network system, sampled at the same discrete time intervals. This reference calculation clarifies how discarding each outgoing ancilla and removing its correlations from subsequent dynamics modifies the attainable entanglement and preparation time. Our results provide a proof of principle demonstration of geometry dependent Bell pair generation and routing in small qubit networks.
We present a study of ballistic electron waveguides as used to construct simple \nquantum computational networks. We begin with an introduction to ballistic \nelectron waveguides, some basic theory of quantum computers, and the \npossible role of electron waveguides in quantum computation. Following that, \nour study of various waveguide networks and the physics of the specific components \nof those networks. We continue with a discussion of shot noise in \nnetwork elements and its possible role in helping to build good computational \ngates. Finally we conclude with a summary of research and possible future \nprojects.
Entanglement generation and distribution is a core functionality of quantum networks. Traditional approaches to this functionality rely on chains of quantum repeaters or on manipulation of multipartite states. In this work, we explore an alternative paradigm that explores quantum coherence at propagation level, by enabling genuine quantum instantiations of communication channels, existing in superposed configurations. We demonstrate that this mechanism can be harnessed to generate both bipartite and multipartite entangled states from separable inputs. Specifically, we show that Bell states can be obtained from initially separable two-qubit states, through the superposition of two unitary quantum channels. The proposed approach is further extended to multipartite systems, by generating n-qubit GHZ and W states and thereby revealing the constructive role of superposed quantum operations in entanglement creation. Moreover, we analyze the robustness of the proposed scheme against noise, showing that the resulting states retain high fidelity and concurrence even under realistic imperfections. Our results suggest that, under appropriate quantum control, noisy superposed paths can be effectively harnessed to engineer entanglement generation and distribution in quantum networks.
We present some results from simulation of a network of nodes connected by c-NOT gates with nearest neighbors. Though initially we begin with pure states of varying boundary conditions, the updating with time quickly involves a complicated entanglement involving all or most nodes. As a normal c-NOT gate, though unitary for a single pair of nodes, seems to be not so when used in a network in a naive way, we use a manifestly unitary form of the transition matrix with c?-NOT gates, which invert the phase as well as flipping the qubit. This leads to complete entanglement of the net, but with variable coefficients for the different components of the superposition. It is interesting to note that by a simple logical back projection the original input state can be recovered in most cases. We also prove that it is not possible for a sequence of unitary operators working on a net to make it move from an aperiodic regime to a periodic one, unlike some classical cases where phase-locking happens in course of evolution. However, we show that it is possible to introduce by hand periodic orbits to sets of initial states, which may be useful in forming dynamic pattern recognition systems.