Cover Image

Clifford+V synthesis for multi-qubit unitary gates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yamazaki, Soichiro, Akibue, Seiseki
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-qubit controlled gate with optimal T-count
by: Yamazaki, Soichiro, et al.
Published: (2026)

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

Probabilistic unitary synthesis with optimal accuracy
by: Akibue, Seiseki, et al.
Published: (2023)

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

Duality of extremal quantum states in verification and data hiding
by: Akibue, Seiseki, et al.
Published: (2025)

Localization of joint quantum measurements on $\mathbb{C}^d \otimes \mathbb{C}^d$ by entangled resources with Schmidt number at most $d$
by: Akibue, Seiseki, et al.
Published: (2026)

Non-locality of conjugation symmetry: characterization and examples in quantum network sensing
by: Miyazaki, Jisho, et al.
Published: (2023)

Computing entanglement costs of non-local operations on the basis of algebraic geometry
by: Akibue, Seiseki, et al.
Published: (2025)

Existence of universal resource and uselessness of too entangled states for quantum metrology
by: Miyajima, Rina, et al.
Published: (2025)

Uniqueness of imaginarity-assisted transformation from computationally universal to strictly universal quantum computation
by: Nakayama, Yasuaki, et al.
Published: (2026)

On the hardness of conversion from entangled proof into separable one
by: Akibue, Seiseki, et al.
Published: (2024)

Circuit Optimization for Universality Transformation
by: Nakayama, Yasuaki, et al.
Published: (2026)

Asymptotic Gate Count Bounds for Ancilla-Free Single-Qubit Synthesis with Arithmetic Gates
by: Sano, Kaoru, et al.
Published: (2025)

Trading T gates for dirty qubits in state preparation and unitary synthesis
by: Low, Guang Hao, et al.
Published: (2018)

Error Crafting in Mixed Quantum Gate Synthesis
by: Yoshioka, Nobuyuki, 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)

Constructing three-qubit unitary gates in terms of Schmidt rank and CNOT gates
by: Song, Zhiwei, et al.
Published: (2020)

Mutual transformations of arbitrary ternary qubit trees by Clifford gates
by: Vlasov, Alexander Yu.
Published: (2024)

Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries
by: Sakamoto, Daisuke, et al.
Published: (2026)

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

Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning
by: Kremer, David, 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)

Fault-tolerant multi-qubit gates in Parity Codes
by: Messinger, Anette, et al.
Published: (2025)

Time-optimal multi-qubit gates: Complexity, efficient heuristic and gate-time bounds
by: Baßler, Pascal, et al.
Published: (2023)

The Clifford theory of the n-qubit Clifford group
by: Mastel, Kieran
Published: (2023)

Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries
by: Mukhopadhyay, Priyanka
Published: (2024)

Efficient compilation of quantum circuits using multi-qubit gates
by: Nemirovsky, Jonathan, et al.
Published: (2025)

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

Quantum circuit for multi-qubit Toffoli gate with optimal resource
by: Nie, Junhong, et al.
Published: (2024)

Quasi-Clifford to qubit mappings
by: Huber, Felix
Published: (2025)

Magic spreading under unitary Clifford dynamics
by: Bejan, Mircea, et al.
Published: (2025)

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

Jenga-Krotov algorithm: Efficient compilation of multi-qubit gates for exchange-only qubits
by: Wu, Jiahao, et al.
Published: (2025)

Decomposition of unitary matrix into quantum gates
by: Fedoriaka, Dmytro
Published: (2025)

Group twirling and noise tailoring for multi-qubit controlled phase gates
by: Liu, Guoding, et al.
Published: (2023)

The Clifford hierarchy for one qubit or qudit
by: de Silva, Nadish, et al.
Published: (2025)

Permutation gates in the third level of the Clifford hierarchy
by: He, Zhiyang, et al.
Published: (2024)

Enabling full localization of qubits and gates with a multi-mode coupler
by: Jiang, Zhongyi, et al.
Published: (2025)

Linear decomposition of approximate multi-controlled single qubit gates
by: Silva, Jefferson D. S., et al.
Published: (2023)