:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cleve, Richard, Ding, Zhiqian, Schaeffer, Luke
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics
Online Access:	https://arxiv.org/abs/2510.04921
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast simulation of planar Clifford circuits
by: Gosset, David, et al.
Published: (2020)

Lower bounds on non-local computation from controllable correlation
by: Cleve, Richard, et al.
Published: (2026)

Any Clifford+T circuit can be controlled with constant T-depth overhead
by: Kim, Isaac H., et al.
Published: (2025)

A complete theory of the Clifford commutant
by: Bittel, Lennart, et al.
Published: (2025)

Reduced constant-cost implementations of Clifford operations using global interactions
by: Nemirovsky, Jonathan, et al.
Published: (2025)

Optimal constant-cost implementations of Clifford operations using global interactions
by: Nemirovsky, Jonathan, et al.
Published: (2025)

Succinct Fermion Data Structures
by: Carolan, Joseph, et al.
Published: (2024)

Linear gate bounds against natural functions for position-verification
by: Asadi, Vahid, et al.
Published: (2024)

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

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

Characterization of permutation gates in the third level of the Clifford hierarchy
by: He, Zhiyang, et al.
Published: (2025)

Clifford operations and homological codes for rotors and oscillators
by: Xu, Yijia, et al.
Published: (2023)

Sample-optimal classical shadows for pure states
by: Grier, Daniel, et al.
Published: (2022)

Principal eigenstate classical shadows
by: Grier, Daniel, et al.
Published: (2024)

Low-depth fermion routing without ancillas
by: Constantinides, Nathan, et al.
Published: (2025)

The Schmidt rank for the commuting operator framework
by: van Luijk, Lauritz, et al.
Published: (2023)

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

Low-depth Clifford circuits approximately solve MaxCut
by: Muñoz-Arias, Manuel H., et al.
Published: (2023)

Streaming quantum state purification for general mixed states
by: Grier, Daniel, et al.
Published: (2025)

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal
by: Carolan, Joseph, et al.
Published: (2025)

Linear Cross Entropy Benchmarking with Clifford Circuits
by: Chen, Jianxin, et al.
Published: (2022)

Mutual averaged non-commutativity of quantum operator algebras
by: Zanardi, Paolo
Published: (2023)

Classical representation of local Clifford operators
by: Wang, Cai-Hong, et al.
Published: (2023)

Catalytic $z$-rotations in constant $T$-depth
by: Kim, Isaac H.
Published: (2025)

Flagging the Clifford hierarchy:~Fault-tolerant logical $\fracπ{2^l}$ rotations via measuring circuit gauge operators of non-Cliffords
by: Dasu, Shival, et al.
Published: (2026)

Non-commutative creation operators for symmetric polynomials
by: Mironov, A., et al.
Published: (2025)

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

Time-frequency Talbot effect as Clifford operations on entangled time-frequency GKP states
by: Pousset, Thomas, et al.
Published: (2026)

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

Clifford entropy
by: Cuffaro, Gianluca, et al.
Published: (2025)

Open quantum systems with non-commuting coupling operators: An analytic approach
by: Garwoła, Jakub, et al.
Published: (2024)

When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits
by: Merkel, Seth, et al.
Published: (2025)

Categorifying Clifford QCA
by: Yang, Bowen
Published: (2025)

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

The NPA hierarchy does not always attain the commuting operator value
by: Fanizza, Marco, et al.
Published: (2025)

Climbing the Clifford Hierarchy
by: Bastioni, Luca, et al.
Published: (2026)

Classical simulability of constant-depth linear-optical circuits with noise
by: Oh, Changhun
Published: (2024)

Approximating dynamical correlation functions with constant depth quantum circuits
by: Irmejs, Reinis, et al.
Published: (2024)

High-Rate Surgery: towards constant-overhead logical operations
by: Zheng, Guo, et al.
Published: (2025)

Shallow shadows: Expectation estimation using low-depth random Clifford circuits
by: Bertoni, Christian, et al.
Published: (2022)