Cover Image

Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vandaele, Vivien, Martiel, Simon, Perdrix, Simon, Vuillot, Christophe
Format:	Preprint
Published:	2023
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters
by: Vandaele, Vivien, et al.
Published: (2024)

A graph-state based synthesis framework for Clifford isometries
by: de Brugière, Timothée Goubault, et al.
Published: (2022)

Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost
by: Vandaele, Vivien
Published: (2025)

Lower T-count with faster algorithms
by: Vandaele, Vivien
Published: (2024)

Qubit-count optimization using ZX-calculus
by: Vandaele, Vivien
Published: (2024)

Asymptotically Optimal Quantum Circuits for Comparators and Incrementers
by: Vandaele, Vivien
Published: (2026)

Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
by: Mhalla, Mehdi, et al.
Published: (2022)

Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes
by: Guernut, Alexandre, et al.
Published: (2024)

Faster and shorter synthesis of Hamiltonian simulation circuits
by: de Brugière, Timothée Goubault, et al.
Published: (2024)

Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus
by: Clément, Alexandre, et al.
Published: (2022)

Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits
by: Delorme, Noé, et al.
Published: (2025)

Pauli Network Circuit Synthesis with Reinforcement Learning
by: Dubal, Ayushi, et al.
Published: (2025)

Matchgate synthesis via Clifford matchgates and $T$ gates
by: Casas, Berta, et al.
Published: (2026)

Clifford synthesis via generalized S and CZ gates
by: Kliuchnikov, Vadym, et al.
Published: (2026)

Benchmarking non-Clifford gates using only Pauli twirling group
by: Ye, Han, et al.
Published: (2025)

Ancilla-free Quantum Adder with Sublinear Depth
by: Remaud, Maxime, et al.
Published: (2025)

Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
by: Claudet, Nathan, et al.
Published: (2025)

Covering a Graph with Minimal Local Sets
by: Claudet, Nathan, et al.
Published: (2024)

Local equivalence of stabilizer states: a graphical characterisation
by: Claudet, Nathan, et al.
Published: (2024)

Clifford+V synthesis for multi-qubit unitary gates
by: Yamazaki, Soichiro, et al.
Published: (2025)

Transversal gates for probabilistic implementation of multi-qubit Pauli rotations
by: Yoshioka, Nobuyuki, et al.
Published: (2025)

Low-overhead error detection with spacetime codes
by: Martiel, Simon, et al.
Published: (2025)

Minimal Equational Theories for Quantum Circuits
by: Clément, Alexandre, et al.
Published: (2023)

Addition and Differentiation of ZX-diagrams
by: Jeandel, Emmanuel, et al.
Published: (2022)

Systematic construction of multi-controlled Pauli gate decompositions with optimal $T$-count
by: Nakanishi, Ken M., et al.
Published: (2024)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
by: Braida, Arthur, et al.
Published: (2023)

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
by: Braida, Arthur, et al.
Published: (2023)

More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization
by: Bothe, Marius, et al.
Published: (2026)

Homological Quantum Rotor Codes: Logical Qubits from Torsion
by: Vuillot, Christophe, et al.
Published: (2023)

Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays
by: Chen, Zi-Han, et al.
Published: (2024)

Pauli Decomposition via the Fast Walsh-Hadamard Transform
by: Georges, Timothy N., et al.
Published: (2024)

Invariants in Linear Optics
by: Draux, Sébastien, et al.
Published: (2025)

Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
by: Ruiz, Diego, et al.
Published: (2025)

Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise
by: Vuillot, Christophe, et al.
Published: (2026)

Optimal algorithms for materializing stabilizer states and Clifford gates from compact descriptions
by: Cha, Hyunho, et al.
Published: (2026)

Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning
by: Kremer, David, et al.
Published: (2025)

Optimal joint cutting of two-qubit rotation gates
by: Ufrecht, Christian, et al.
Published: (2023)

Randomized benchmarking for qudit Clifford gates
by: Jafarzadeh, Mahnaz, et al.
Published: (2019)

Single-qubit rotation algorithm with logarithmic Toffoli count and gate depth
by: Hindlycke, Christoffer, et al.
Published: (2024)

Letting the tiger out of its cage: bosonic coding without concatenation
by: Xu, Yijia, et al.
Published: (2024)