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

Journal of Applied Mathematics and Physics

Generation of Quantum Vector States Using the Exchange Interaction

Mrittunjoy Guha Majumdar

Published Jan 1, 2019• 1 citation
Publisher

Abstract

In this paper, I study the invariant subspaces of quantum states under SWAPα gates arising from the exchange interaction and their use in quantum computation. I investigate the generation and characterization of invariant-subspace vector-states that arise from such gates. I also state a condition for the locus of states that are accessible using the SWAPα gates, given an initial input state.

DOI
10.4236/jamp.2019.712219

Related papers

Quantum Information Processing using the Power-of-SWAP

Mrittunjoy Guha Majumdar

This project is a comprehensive investigation into the application of the exchange interaction, particularly with the realization of the SWAP^1/n quantum operator, in quantum information processing. We study the generation, characterization and application of entanglement in such systems. Given the non-commutativity of neighbouring SWAP^1/n gates, the mathematical study of combinations of these gates is an interesting avenue of research that we have explored, though due to the exponential scaling of the complexity of the problem with the number of qubits in the system, numerical techniques, though good for few-qubit systems, are found to be inefficient for this research problem when we look at systems with higher number of qubits. Since the group of SWAP^1/n operators is found to be isomorphic to the symmetric group Sn, we employ group-theoretic methods to find the relevant invariant subspaces and associated vector-states. Some interesting patterns of states are found including onedimensional invariant subspaces spanned by W-states and the Hamming-weight preserving symmetry of the vectors spanning the various invariant subspaces. We also devise new ways of characterizing entanglement and approach the separability problem by looking at permutation symmetries of subsystems of quantum states. This idea is found to form a bridge with the entanglement characterization tool of Peres-Horodecki’s Partial Positive Transpose (PPT), for mixed quantum states. We also look at quantum information taskoriented ‘distance’ measures of entanglement, besides devising a new entanglement witness in the ‘engle’. In terms of applications, we define five different formalisms for quantum computing: the circuit-based model, the encoded qubit model, the cluster-state model, functional quantum computation and the qudit-based model. Later in the thesis, we explore the idea of quantum computing based on decoherence-free subspaces. We also investigate ways of applying the SWAP^1/n in entanglement swapping for quantum repeaters, quantum communication protocols and quantum memory.

•Jul 27, 2018•0 citations

Invariant subspaces of two-qubit quantum gates and their application in the verification of quantum computers

Jacob Chevalier Drori, Yordan S. Yordanov, T. Ferrus +2 more

We present a set of techniques, based on the repeated arbitrary application of cp, cnot, and swap${}^{\ensuremath{\alpha}}$ (power-of-swap) quantum gate operations to an $n$-qubit quantum computer that can be used in its verification. We find isomorphisms between the groups generated by these gate operations and known groups and use techniques from representation theory to determine their invariant subspaces. For the cp operation, we find an isomorphism to the direct product of $n(n\ensuremath{-}1)/2$ cyclic groups of order 2, and determine ${2}^{n}$ one-dimensional invariant subspaces corresponding to the computational-basis vectors. For the cnot operation, we find an isomorphism to $GL(n,2)$, and determine two one-dimensional invariant subspaces and one $({2}^{n}\ensuremath{-}2)$-dimensional invariant subspace. For the swap${}^{\ensuremath{\alpha}}$ operation we find a complex structure of invariant subspaces with varying dimensions and occurrences and present a recursive procedure to construct them. Using knowledge of these invariant subspaces, we propose a hardware verification scheme which tests the correct functioning of a quantum computer.

arXiv:2009.03642•Physical Review A•Nov 24, 2021•1 citation

The Power of Power-of-SWAP: Postselected Quantum Computation with the Exchange Interaction

Jędrzej Burkat, Sergii Strelchuk, Michał Studziński

We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this restricted model captures decoherence-free subspace computation without access to singlet states. We prove that XQP, as well as its constrained family consisting solely of $\sqrt{\mathrm{SWAP}}$ gates, is universal for quantum computation under polynomial overheads in circuit depth and size. This establishes the universality of the $\sqrt{\mathrm{SWAP}}$ gate on its own under a logical encoding of qubits. We further prove that circuits generated by $\sqrt{\mathrm{SWAP}}$ gates are semi-universal, and thus generate $t$-designs for the uniform distribution over SU(2)-invariant unitaries. Finally, we study additional properties of the XQP model, including its relation to the six-vertex and Potts model in statistical physics. Our findings suggest that XQP circuits are naturally suited to near-term hardware and provide a simple platform for experimental demonstrations of quantum advantage.

quant-pharXiv:2603.28527•Mar 31, 2026•1 citation

Quantum Information Processing Using the Exchange Interaction

Mrittunjoy Guha Majumdar

In this paper, I propose new models of quantum information processing using the exchange interaction in physical systems. The partial SWAP operator that can be realized using the exchange interaction is used as the underlying resource for defining models of quantum computation, quantum communication, quantum memory and decoherence-free subspaces. Given the non-commutativity of these operators (for adjacent operators operating on a common qubit), a number of quantum states and entanglement patters can be obtained. This zoo of states can be classified, due to the parity constraints and permutation symmetry of the states, into invariant subspaces that are used for the definition of some of the applications in this paper.

Journal of Quantum Information Science•Jan 1, 2018•10 citations

Quantum computing with the exchange interaction

David Peter Divincenzo

I discuss the strategies which might be employed for using exchange-coupled solid-state quantum dots for quantum computation. The basic construction of Loss and DiVincenzo will be reviewed, in which mechanisms for generating SWAP gates and one bit gates were introduced. I will present our recent results showing that SWAP gates alone are enough to do quantum computing. I will also introduce some recent results on methods for minimizing the effects spin-orbit coupling in exchange quantum computing.

•Jun 13, 2001•0 citations

On model reduction for quantum dynamics: symmetries and invariant subspaces

Akshat Kumar, Mohan Sarovar

Simulation of quantum dynamics is a grand challenge of computational physics. In this work we investigate methods for reducing the demands of such simulation by identifying reduced-order models for dynamics generated by parameterized quantum Hamiltonians. In particular, we first formulate an algebraic condition that certifies the existence of invariant subspaces for a model defined by a parameterized Hamiltonian and an initial state. Following this we develop and analyze two methods to explicitly construct a reduced-order model, if one exists. In addition to general results characterizing invariant subspaces of arbitrary finite dimensional Hamiltonians, by exploiting properties of the generalized Pauli group we develop practical tools to speed up simulation of dynamics generated by certain spin Hamiltonians. To illustrate the methods developed we apply them to several paradigmatic spin models.

arXiv:1406.7069•Journal of Physics A Mathematical and Theoretical•Dec 8, 2014•8 citations
In this paper, I study the invariant subspaces of quantum states under SWAPα gates arising from the exchange interaction and their use in quantum computation. I investigate the generation and characterization of invariant-subspace vector-states that arise from such gates. I also state a condition for the locus of states that are accessible using the SWAPα gates, given an initial input state.
This project is a comprehensive investigation into the application of the exchange interaction, particularly with the realization of the SWAP^1/n quantum operator, in quantum information processing. We study the generation, characterization and application of entanglement in such systems. Given the non-commutativity of neighbouring SWAP^1/n gates, the mathematical study of combinations of these gates is an interesting avenue of research that we have explored, though due to the exponential scaling of the complexity of the problem with the number of qubits in the system, numerical techniques, though good for few-qubit systems, are found to be inefficient for this research problem when we look at systems with higher number of qubits. Since the group of SWAP^1/n operators is found to be isomorphic to the symmetric group Sn, we employ group-theoretic methods to find the relevant invariant subspaces and associated vector-states. Some interesting patterns of states are found including onedimensional invariant subspaces spanned by W-states and the Hamming-weight preserving symmetry of the vectors spanning the various invariant subspaces. We also devise new ways of characterizing entanglement and approach the separability problem by looking at permutation symmetries of subsystems of quantum states. This idea is found to form a bridge with the entanglement characterization tool of Peres-Horodecki’s Partial Positive Transpose (PPT), for mixed quantum states. We also look at quantum information taskoriented ‘distance’ measures of entanglement, besides devising a new entanglement witness in the ‘engle’. In terms of applications, we define five different formalisms for quantum computing: the circuit-based model, the encoded qubit model, the cluster-state model, functional quantum computation and the qudit-based model. Later in the thesis, we explore the idea of quantum computing based on decoherence-free subspaces. We also investigate ways of applying the SWAP^1/n in entanglement swapping for quantum repeaters, quantum communication protocols and quantum memory.
We present a set of techniques, based on the repeated arbitrary application of cp, cnot, and swap${}^{\ensuremath{\alpha}}$ (power-of-swap) quantum gate operations to an nnn-qubit quantum computer that can be used in its verification. We find isomorphisms between the groups generated by these gate operations and known groups and use techniques from representation theory to determine their invariant subspaces. For the cp operation, we find an isomorphism to the direct product of $n(n\ensuremath{-}1)/2$ cyclic groups of order 2, and determine 2n{2}^{n}2n one-dimensional invariant subspaces corresponding to the computational-basis vectors. For the cnot operation, we find an isomorphism to GL(n,2)GL(n,2)GL(n,2), and determine two one-dimensional invariant subspaces and one $({2}^{n}\ensuremath{-}2)$-dimensional invariant subspace. For the swap${}^{\ensuremath{\alpha}}$ operation we find a complex structure of invariant subspaces with varying dimensions and occurrences and present a recursive procedure to construct them. Using knowledge of these invariant subspaces, we propose a hardware verification scheme which tests the correct functioning of a quantum computer.
We introduce Exchange Quantum Polynomial Time (XQP) circuits, which comprise quantum computation using only computational basis SPAM and the isotropic Heisenberg exchange interaction. Structurally, this restricted model captures decoherence-free subspace computation without access to singlet states. We prove that XQP, as well as its constrained family consisting solely of SWAP\sqrt{\mathrm{SWAP}}SWAP​ gates, is universal for quantum computation under polynomial overheads in circuit depth and size. This establishes the universality of the SWAP\sqrt{\mathrm{SWAP}}SWAP​ gate on its own under a logical encoding of qubits. We further prove that circuits generated by SWAP\sqrt{\mathrm{SWAP}}SWAP​ gates are semi-universal, and thus generate ttt-designs for the uniform distribution over SU(2)-invariant unitaries. Finally, we study additional properties of the XQP model, including its relation to the six-vertex and Potts model in statistical physics. Our findings suggest that XQP circuits are naturally suited to near-term hardware and provide a simple platform for experimental demonstrations of quantum advantage.
In this paper, I propose new models of quantum information processing using the exchange interaction in physical systems. The partial SWAP operator that can be realized using the exchange interaction is used as the underlying resource for defining models of quantum computation, quantum communication, quantum memory and decoherence-free subspaces. Given the non-commutativity of these operators (for adjacent operators operating on a common qubit), a number of quantum states and entanglement patters can be obtained. This zoo of states can be classified, due to the parity constraints and permutation symmetry of the states, into invariant subspaces that are used for the definition of some of the applications in this paper.
I discuss the strategies which might be employed for using exchange-coupled solid-state quantum dots for quantum computation. The basic construction of Loss and DiVincenzo will be reviewed, in which mechanisms for generating SWAP gates and one bit gates were introduced. I will present our recent results showing that SWAP gates alone are enough to do quantum computing. I will also introduce some recent results on methods for minimizing the effects spin-orbit coupling in exchange quantum computing.
Simulation of quantum dynamics is a grand challenge of computational physics. In this work we investigate methods for reducing the demands of such simulation by identifying reduced-order models for dynamics generated by parameterized quantum Hamiltonians. In particular, we first formulate an algebraic condition that certifies the existence of invariant subspaces for a model defined by a parameterized Hamiltonian and an initial state. Following this we develop and analyze two methods to explicitly construct a reduced-order model, if one exists. In addition to general results characterizing invariant subspaces of arbitrary finite dimensional Hamiltonians, by exploiting properties of the generalized Pauli group we develop practical tools to speed up simulation of dynamics generated by certain spin Hamiltonians. To illustrate the methods developed we apply them to several paradigmatic spin models.