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

Natural Computing

Gravitationally invariant subspaces in quantum computing

Tanner Crowder, Marco O. Lanzagorta

Published Jan 10, 2023• 2 citations
Publisher
DOI
10.1007/s11047-022-09938-7

Related papers

Gravitational Topological Quantum Computation

Mario E. Vélez, Juan Ospina

Lecture notes in computer science•Aug 22, 2007•1 citation

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

Geometric Quantum Computing

Eduardo Jose Bayro-Corrochano

Springer eBooks•Jan 1, 2024•0 citations

Generation of Quantum Vector States Using the Exchange Interaction

Mrittunjoy Guha Majumdar

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.

Journal of Applied Mathematics and Physics•Jan 1, 2019•1 citation

Uniformly decaying subspaces for error-mitigated quantum computation

Nishchay Suri, Jason Saied, Davide Venturelli

We present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

arXiv:2403.00163•Physical Review A•Oct 18, 2024•3 citations

Applications of Geometric Quantum Computing

Eduardo Jose Bayro-Corrochano

Springer eBooks•Jan 1, 2024•1 citation
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 present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.