Cover Image

Unitary synthesis with fewer T gates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tan, Xinyu
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random Unitaries in Constant (Quantum) Time
by: Foxman, Ben, et al.
Published: (2025)

Constant-Depth Unitary Preparation of Dicke States
by: Joshi, Malvika Raj, et al.
Published: (2026)

Lower Bounds for Unitary Property Testing with Proofs and Advice
by: Weggemans, Jordi
Published: (2024)

Efficient approximate unitary designs from random Pauli rotations
by: Haah, Jeongwan, et al.
Published: (2024)

Query and Depth Upper Bounds for Quantum Unitaries via Grover Search
by: Rosenthal, Gregory
Published: (2021)

Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)

How to Construct Random Unitaries
by: Ma, Fermi, et al.
Published: (2024)

Unitary Complexity and the Uhlmann Transformation Problem
by: Bostanci, John, et al.
Published: (2023)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
by: Coble, Nolan J., et al.
Published: (2023)

An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate
by: Daskin, Ammar
Published: (2024)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

Incompressibility and spectral gaps of random circuits
by: Chen, Chi-Fang, et al.
Published: (2024)

Strict Hierarchy for Quantum Channel Certification to Unitary
by: Chen, Kean, et al.
Published: (2026)

Learning quantum states and unitaries of bounded gate complexity
by: Zhao, Haimeng, et al.
Published: (2023)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
by: Lin, Ting-Chun
Published: (2024)

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
by: Allcock, Jonathan, et al.
Published: (2023)

Beating full state tomography for unentangled spectrum estimation
by: Pelecanos, Angelos, et al.
Published: (2025)

The power of quantum circuits in sampling
by: Blanc, Guy, et al.
Published: (2025)

Convergence efficiency of quantum gates and circuits
by: Kong, Linghang, et al.
Published: (2024)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
by: Cardoso, Ricardo Rivera, et al.
Published: (2025)

More-efficient Quantum Multivariate Mean Value Estimator from Generalized Grover Operator
by: Tang, Letian
Published: (2025)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
by: Grewal, Sabee, et al.
Published: (2025)

Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)

Peaked quantum advantage using error correction
by: Deshpande, Abhinav, et al.
Published: (2025)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
by: Grier, Daniel, et al.
Published: (2025)

Graphical Tests of Causality
by: Baumeler, Ämin, et al.
Published: (2025)

Tight Success Probabilities for Quantum Period Finding and Phase Estimation
by: Magdon-Ismail, Malik, et al.
Published: (2025)

Syndrome aware mitigation of logical errors
by: Aharonov, Dorit, et al.
Published: (2025)

On the Complexity of the Succinct State Local Hamiltonian Problem
by: Waite, Gabriel, et al.
Published: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization
by: Skarlatos, Vasilis, et al.
Published: (2025)

Shadow Tomography Against Adversaries
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
by: Sakamoto, Kazuki, et al.
Published: (2025)

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
by: Suruga, Daiki
Published: (2025)

Magic and communication complexity
by: Girish, Uma, et al.
Published: (2025)

Bounds on Eventually Universal Quantum Gate Sets
by: Karamchedu, Chaitanya, et al.
Published: (2025)

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
by: Upreti, Varun, et al.
Published: (2025)

The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians
by: Waite, Gabriel
Published: (2025)

The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
by: Waite, Gabriel, et al.
Published: (2025)