Cover Image

A graph-state based synthesis framework for Clifford isometries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	de Brugière, Timothée Goubault, Martiel, Simon, Vuillot, Christophe
Format:	Preprint
Published:	2022
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
by: Vandaele, Vivien, et al.
Published: (2023)

Fast and memory efficient strong simulation of noisy adaptive linear optical circuits
by: de Brugière, Timothée Goubault, et al.
Published: (2025)

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

New designs of linear optical interferometers with minimal depth and component count
by: de Brugière, Timothée Goubault, et al.
Published: (2025)

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

Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices
by: Wein, Stephen C., et al.
Published: (2024)

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

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

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

Complexity of graph-state preparation by Clifford circuits
by: Kumabe, Soh, et al.
Published: (2024)

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

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

Quantum circuit compression using qubit logic on qudits
by: Lysaght, Liam, et al.
Published: (2024)

High-performance local decoders for defect matching in 1D
by: Paletta, Louis, et al.
Published: (2025)

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)

Robust sparse IQP sampling in constant depth
by: Paletta, Louis, et al.
Published: (2023)

LDPC-cat codes for low-overhead quantum computing in 2D
by: Ruiz, Diego, et al.
Published: (2024)

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)

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

A Rubik's Cube inspired approach to Clifford synthesis
by: Bao, Ning, et al.
Published: (2023)

pygridsynth: A fast numerical tool for ancilla-free Clifford+T synthesis
by: Yamamoto, Shuntaro, et al.
Published: (2026)

Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
by: Liu, Zejun, et al.
Published: (2024)

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

Big cats: entanglement in 120 qubits and beyond
by: Javadi-Abhari, Ali, et al.
Published: (2025)

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

Optimal ancilla-free Clifford+T synthesis for general single-qubit unitaries
by: Morisaki, Hayata, et al.
Published: (2025)

A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
by: Campbell, Earl T., et al.
Published: (2016)

A Classification of Transversal Clifford Gates for Qubit Stabilizer Codes
by: Dasu, Shival, et al.
Published: (2025)

Probabilistic state synthesis based on optimal convex approximation
by: Akibue, Seiseki, et al.
Published: (2023)

Fold-Transversal Clifford Gates for Quantum Codes
by: Breuckmann, Nikolas P., et al.
Published: (2022)

Simulating magic state cultivation with few Clifford terms
by: Wan, Kwok Ho, et al.
Published: (2025)

Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
by: Patil, Ashlesha, et al.
Published: (2023)

Constant depth magic state cultivation with Clifford measurements by gauging
by: Hetényi, Bence, et al.
Published: (2026)

Quantum theory based on real numbers cannot be experimentally falsified
by: Hoffreumon, Timothée, et al.
Published: (2026)

Design and efficiency in graph-state computation
by: Bowen, Greg, et al.
Published: (2025)

A unifying primary framework for quantum graph neural networks from quantum graph states
by: Daskin, Ammar
Published: (2024)

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