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

International Journal of Theoretical Physics

Note on Generalized Quantum Gates and Quantum Operations

Yueqing Wang, Hong-Ke Du, Yan-Ni Dou

Published Jan 24, 2008• 35 citations
Publisher
DOI
10.1007/s10773-008-9659-4

Related papers

A Note on Fixed Points of General Quantum Operations

Haiyan Zhang, Guoxing Ji

Reports on Mathematical Physics•Aug 1, 2012•6 citations

A note on diagonal gates in SZX-calculus

Titouan Carette

This note describes how the the scalable ZXH calculus can be used to represent in a compact way the quantum gates that are diagonal in the computational basis. This includes controlled and multi-controlled Z gates, their generalizations, respectively graph and hypergraph operators, and also phase gadgets.

arXiv:2012.09540•Dec 17, 2020•4 citations

Some Properties of Generalized Quantum Operations

Yuan Li, Xiu-Hong Sun, Yan-Ni Dou

International Journal of Theoretical Physics•Jan 11, 2013•3 citations

On quantum operations as quantum states

Pablo J. Arrighi, Christophe Patricot

arXiv:quant-ph/0307024•Annals of Physics•Dec 22, 2003•53 citations

Gate simulation and lower bounds on the simulation time

Robert Zeier, Markus Grassl, Thomas Beth

Unitary operations are the building blocks of quantum programs. Our task is to design efficient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given $n$-qubit system. The most common versions of this task are known as Hamiltonian simulation and gate simulation, where Hamiltonian simulation can be seen as an infinitesimal version of the general task of gate simulation. We present a Lie-theoretic approach to Hamiltonian simulation and gate simulation. From this, we derive lower bounds on the time complexity in the $n$-qubit case, generalizing known results to both even and odd $n$. To achieve this we develop a generalization of the so-called magic basis for two-qubits. As a corollary, we note a connection to entanglement measures of concurrence-type.

arXiv:quant-ph/0403082•Physical Review A•Sep 22, 2004•26 citations

Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction

Junichi Haruna

The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.

hep-thCross-listedarXiv:2511.15224•Progress of Theoretical and Experimental Physics•Nov 20, 2025•4 citations
Unitary operations are the building blocks of quantum programs. Our task is to design efficient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given nnn-qubit system. The most common versions of this task are known as Hamiltonian simulation and gate simulation, where Hamiltonian simulation can be seen as an infinitesimal version of the general task of gate simulation. We present a Lie-theoretic approach to Hamiltonian simulation and gate simulation. From this, we derive lower bounds on the time complexity in the nnn-qubit case, generalizing known results to both even and odd nnn. To achieve this we develop a generalization of the so-called magic basis for two-qubits. As a corollary, we note a connection to entanglement measures of concurrence-type.
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.