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:2203.01141 · Quantum Information and Computation

Implementing the quantum fanout operation with simple pairwise interactions

Stephen Fenner, Rabins Wosti

Published Nov 1, 2023• 4 citations
arXivHTMLPDF

Abstract

It has been shown that, for even $n$, evolving $n$ qubits according to a Hamiltonian that is the sum of pairwise interactions between the particles, can be used to exactly implement an $(n+1)$-qubit fanout gate using a particular constant-depth circuit~[\href{https://arXiv.org/abs/quant-ph/0309163}{arXiv:quant-ph/0309163}]. However, the coupling coefficients in the Hamiltonian considered in that paper are assumed to be all equal. In this paper, we generalize these results and show that for all $n$, including odd $n$, one can exactly implement an $(n+1)$-qubit parity gate and hence, equivalently in constant depth an $(n+1)$-qubit fanout gate, using a similar Hamiltonian but with unequal couplings, and we give an exact characterization of the constraints that the couplings must satisfy in order for them to be adequate to implement fanout via the same circuit.}{In particular, we show the following:Letting $J_{ij}$ be the coupling strength between the $\ordth{i}$ and $\ordth{j}$ qubits, the set of couplings $\{J_{ij}\}$ is adequate to implement fanout via the circuit above if and only if there exists $J>0$ such that 1. each $J_{ij}$ is an odd integer multiple of $J$, and 2. for each $i$, there are an even number of $j\ne i$ such that $J_{ij}/J \equiv 3\pmod{4}$.

DOI
10.26421/qic23.13-14-1

Related papers

Quantum Fanout and GHZ states using spin-exchange interactions

Stephen Fenner, Rabins Wosti

We show how the fanout operation on $n$ logical qubits can be implemented via spin-exchange (Heisenberg) interactions between $2n$ physical qubits, together with a physical target qubit and $1$- and $2$-qubit gates in constant depth. We also show that the same interactions can be used to implement Mod_q gates for any $q>1$. These results allow for unequal coupling strengths between physical qubits. This work generalizes an earlier result by Fenner & Zhang [arXiv: quant-ph/0407125], wherein the authors showed similar results assuming all pairwise couplings are equal. The current results give exact conditions on the pairwise couplings that allow for this implementation. Precisely, each logical qubit is encoded into two physical qubits. Couplings between physical qubits encoding the same logical qubit are termed as internal couplings and couplings between the ones encoding different logical qubits are termed as external couplings. We show that for a suitable time $T$ of evolution, the following conditions should hold: a) every external coupling should be an odd integer multiple of $π/2T$; b) every internal coupling should be an integer multiple of $π/T$; and c) the external magnetic strength in $z$-direction should be an integer multiple of $π/T$. Since generalized GHZ (''cat'') states can be created in constant depth using fanout, the same interactions can be used to create these states.

arXiv:2502.10602•Feb 14, 2025•0 citations

Implementing the fanout gate by a Hamiltonian

Stephen Fenner

We show that, for even n, evolving n qubits according to a simple Hamiltonian can be used to exactly implement an (n+1)-qubit parity gate, which is equivalent in constant depth to an (n+1)-qubit fanout gate. We also observe that evolving the Hamiltonian for three qubits results in an inversion-on-three-way-equality gate, which together with single-qubit operations is universal for quantum computation.

arXiv:quant-ph/0309163•Sep 23, 2003•8 citations

Implementing fanout, parity, and Mod gates via spin exchange interactions

Stephen Fenner, Yong Zhang

We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or nonisotropic versions of the interaction can be used. We generalize our basic results by showing that any Hamiltonian (acting on suitably encoded logical qubits), whose eigenvalues depend quadratically on the Hamming weight of the logical qubit values, can be used to implement generalized Mod_q gates for any q > 1. This paper is a sequel to quant-ph/0309163, and resolves a question left open in that paper.

arXiv:quant-ph/0407125•Jul 16, 2004•3 citations

Quantum Fanout and GHZ states using spin-exchange interactions*

Stephen Fenner, Rabins Wosti

We show how the fanout operation on p logical qubits can be implemented via spin-exchange (Heisenberg) interactions between 2p physical qubits, together with a physical target qubit and a constant number of 1- and 2-qubit gates. We also show that the same interactions can be used to implement Modqgates for any q>1. These results allow for unequal coupling strengths between physical qubits. This work strengthens an earlier result by Fenner & Zhang [arXiv:quant-ph/0407125], wherein the authors showed similar results assuming all pairwise couplings are equal. The current results give exact conditions on the pairwise couplings that allow for this implementation. Precisely, each logical qubit is encoded into two physical qubits. Couplings between physical qubits encoding the same logical qubit we call internal couplings and couplings between the ones encoding different logical qubits we call external couplings. We show that for any fixed time T of evolution, the following conditions suffice: a) every external coupling should be an odd integer multiple of π/2T; b) every internal coupling should be an integer multiple of π/T; and c) the external magnetic strength in the z-direction should be an integer multiple of π/T. Since generalized GHZ ("cat") states can be created in constant depth using fanout, the same interactions can be used to create these states.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

Quantum lower bounds for fanout

Maosen Fang, Stephen Fenner, F. Green +2 more

We consider the resource bounded quantum circuit model with circuits restricted by the number of qubits they act upon and by their depth. Focusing on natural universal sets of gates which are familiar from classical circuit theory, several new lower bounds for constant depth quantum circuits are proved. The main result is that parity (and hence fanout) requires log depth quantum circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when they use only constantly many ancill\ae. Under this constraint, this bound is close to optimal. In the case of a non-constant number $a$ of ancill\ae\ and $n$ input qubits, we give a tradeoff between $a$ and the required depth, that results in a non-constant lower bound for fanout when $a = n^{1-o(1)}$. We also show that, regardless of the number of ancill\ae\, arbitrary arity Toffoli gates cannot be simulated exactly by a constant depth circuit family with gates of bounded arity.

arXiv:quant-ph/0312208•Quantum Information and Computation•Jan 1, 2006•28 citations

Depth-2 QAC circuits cannot simulate quantum parity

Daniel Padé, Stephen Fenner, Daniel Grier +1 more

We show that the quantum parity gate on $n > 3$ qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla qubits. This is the best known and first nontrivial separation between the parity gate and circuits of this form. The same bounds also apply to the quantum fanout gate. Our results are incomparable with those of Fang et al. [3], which apply to any constant depth but require a sublinear number of ancilla qubits on the simulating circuit.

arXiv:2005.12169•May 25, 2020•2 citations
It has been shown that, for even nnn, evolving nnn qubits according to a Hamiltonian that is the sum of pairwise interactions between the particles, can be used to exactly implement an (n+1)(n+1)(n+1)-qubit fanout gate using a particular constant-depth circuit~[\href{https://arXiv.org/abs/quant-ph/0309163}{arXiv:quant-ph/0309163}]. However, the coupling coefficients in the Hamiltonian considered in that paper are assumed to be all equal. In this paper, we generalize these results and show that for all nnn, including odd nnn, one can exactly implement an (n+1)(n+1)(n+1)-qubit parity gate and hence, equivalently in constant depth an (n+1)(n+1)(n+1)-qubit fanout gate, using a similar Hamiltonian but with unequal couplings, and we give an exact characterization of the constraints that the couplings must satisfy in order for them to be adequate to implement fanout via the same circuit.}{In particular, we show the following:Letting JijJ_{ij}Jij​ be the coupling strength between the \ordthi\ordth{i}\ordthi and \ordthj\ordth{j}\ordthj qubits, the set of couplings {Jij}\{J_{ij}\}{Jij​} is adequate to implement fanout via the circuit above if and only if there exists J>0J>0J>0 such that 1. each JijJ_{ij}Jij​ is an odd integer multiple of JJJ, and 2. for each iii, there are an even number of j≠ij\ne ij=i such that Jij/J≡3(mod4)J_{ij}/J \equiv 3\pmod{4}Jij​/J≡3(mod4).
We show how the fanout operation on nnn logical qubits can be implemented via spin-exchange (Heisenberg) interactions between 2n2n2n physical qubits, together with a physical target qubit and 111- and 222-qubit gates in constant depth. We also show that the same interactions can be used to implement Mod_q gates for any q>1q>1q>1. These results allow for unequal coupling strengths between physical qubits. This work generalizes an earlier result by Fenner & Zhang [arXiv: quant-ph/0407125], wherein the authors showed similar results assuming all pairwise couplings are equal. The current results give exact conditions on the pairwise couplings that allow for this implementation. Precisely, each logical qubit is encoded into two physical qubits. Couplings between physical qubits encoding the same logical qubit are termed as internal couplings and couplings between the ones encoding different logical qubits are termed as external couplings. We show that for a suitable time TTT of evolution, the following conditions should hold: a) every external coupling should be an odd integer multiple of π/2Tπ/2Tπ/2T; b) every internal coupling should be an integer multiple of π/Tπ/Tπ/T; and c) the external magnetic strength in zzz-direction should be an integer multiple of π/Tπ/Tπ/T. Since generalized GHZ (''cat'') states can be created in constant depth using fanout, the same interactions can be used to create these states.
We show that, for any n > 0, the Heisenberg interaction among 2n qubits (as spin-1/2 particles) can be used to exactly implement an n-qubit parity gate, which is equivalent in constant depth to an n-qubit fanout gate. Either isotropic or nonisotropic versions of the interaction can be used. We generalize our basic results by showing that any Hamiltonian (acting on suitably encoded logical qubits), whose eigenvalues depend quadratically on the Hamming weight of the logical qubit values, can be used to implement generalized Mod_q gates for any q > 1. This paper is a sequel to quant-ph/0309163, and resolves a question left open in that paper.
We show how the fanout operation on p logical qubits can be implemented via spin-exchange (Heisenberg) interactions between 2p physical qubits, together with a physical target qubit and a constant number of 1- and 2-qubit gates. We also show that the same interactions can be used to implement Modqgates for any q>1. These results allow for unequal coupling strengths between physical qubits. This work strengthens an earlier result by Fenner & Zhang [arXiv:quant-ph/0407125], wherein the authors showed similar results assuming all pairwise couplings are equal. The current results give exact conditions on the pairwise couplings that allow for this implementation. Precisely, each logical qubit is encoded into two physical qubits. Couplings between physical qubits encoding the same logical qubit we call internal couplings and couplings between the ones encoding different logical qubits we call external couplings. We show that for any fixed time T of evolution, the following conditions suffice: a) every external coupling should be an odd integer multiple of π/2T; b) every internal coupling should be an integer multiple of π/T; and c) the external magnetic strength in the z-direction should be an integer multiple of π/T. Since generalized GHZ ("cat") states can be created in constant depth using fanout, the same interactions can be used to create these states.
We consider the resource bounded quantum circuit model with circuits restricted by the number of qubits they act upon and by their depth. Focusing on natural universal sets of gates which are familiar from classical circuit theory, several new lower bounds for constant depth quantum circuits are proved. The main result is that parity (and hence fanout) requires log depth quantum circuits, when the circuits are composed of single qubit and arbitrary size Toffoli gates, and when they use only constantly many ancill\ae. Under this constraint, this bound is close to optimal. In the case of a non-constant number aaa of ancill\ae\ and nnn input qubits, we give a tradeoff between aaa and the required depth, that results in a non-constant lower bound for fanout when a=n1−o(1)a = n^{1-o(1)}a=n1−o(1). We also show that, regardless of the number of ancill\ae\, arbitrary arity Toffoli gates cannot be simulated exactly by a constant depth circuit family with gates of bounded arity.
We show that the quantum parity gate on n>3n > 3n>3 qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla qubits. This is the best known and first nontrivial separation between the parity gate and circuits of this form. The same bounds also apply to the quantum fanout gate. Our results are incomparable with those of Fang et al. [3], which apply to any constant depth but require a sublinear number of ancilla qubits on the simulating circuit.