Saved in:
| Main Authors: | Zongbo, Bao, Briët, Jop, Castro-Silva, Davi, van Dordrecht, Philippe, Helsen, Jonas |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.26983 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Clifford testing: algorithms and lower bounds
by: Hinsche, Marcel, et al.
Published: (2025)
by: Hinsche, Marcel, et al.
Published: (2025)
Tolerant testing of stabilizer states with a polynomial gap via a generalized uncertainty relation
by: Bao, Zongbo, et al.
Published: (2024)
by: Bao, Zongbo, et al.
Published: (2024)
A near-optimal Quadratic Goldreich-Levin algorithm
by: Briët, Jop, et al.
Published: (2025)
by: Briët, Jop, et al.
Published: (2025)
Random restrictions of high-rank tensors and polynomial maps
by: Briët, Jop, et al.
Published: (2022)
by: Briët, Jop, et al.
Published: (2022)
On the threshold for Szemerédi's theorem with random differences
by: Briët, Jop, et al.
Published: (2023)
by: Briët, Jop, et al.
Published: (2023)
Noisy decoding by shallow circuits with parities: classical and quantum
by: Briët, Jop, et al.
Published: (2023)
by: Briët, Jop, et al.
Published: (2023)
Error correction with brickwork Clifford circuits
by: Kroll, Twan, et al.
Published: (2026)
by: Kroll, Twan, et al.
Published: (2026)
Grothendieck inequalities characterize converses to the polynomial method
by: Briët, Jop, et al.
Published: (2022)
by: Briët, Jop, et al.
Published: (2022)
Single-copy stabilizer testing
by: Hinsche, Marcel, et al.
Published: (2024)
by: Hinsche, Marcel, et al.
Published: (2024)
Discreteness of asymptotic tensor ranks
by: Briët, Jop, et al.
Published: (2023)
by: Briët, Jop, et al.
Published: (2023)
The Clifford hierarchy for one qubit or qudit
by: de Silva, Nadish, et al.
Published: (2025)
by: de Silva, Nadish, et al.
Published: (2025)
An algorithmic Polynomial Freiman-Ruzsa theorem
by: Castro-Silva, Davi, et al.
Published: (2026)
by: Castro-Silva, Davi, et al.
Published: (2026)
A Bravyi-König theorem for Floquet codes generated by locally conjugate instantaneous stabiliser groups
by: Mackeprang, Jelena, et al.
Published: (2026)
by: Mackeprang, Jelena, et al.
Published: (2026)
Controlled jump in the Clifford hierarchy
by: Xu, Yichen, et al.
Published: (2026)
by: Xu, Yichen, et al.
Published: (2026)
Matchgate hierarchy: A Clifford-like hierarchy for deterministic gate teleportation in matchgate circuits
by: Bampounis, Angelos, et al.
Published: (2024)
by: Bampounis, Angelos, et al.
Published: (2024)
Trotter error and gate complexity of the SYK and sparse SYK models
by: Chen, Yiyuan, et al.
Published: (2025)
by: Chen, Yiyuan, et al.
Published: (2025)
Permutation gates in the third level of the Clifford hierarchy
by: He, Zhiyang, et al.
Published: (2024)
by: He, Zhiyang, et al.
Published: (2024)
Anti-concentration is (almost) all you need
by: Heinrich, Markus, et al.
Published: (2025)
by: Heinrich, Markus, et al.
Published: (2025)
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
by: Buhrman, Harry, et al.
Published: (2024)
by: Buhrman, Harry, et al.
Published: (2024)
Characterization of permutation gates in the third level of the Clifford hierarchy
by: He, Zhiyang, et al.
Published: (2025)
by: He, Zhiyang, et al.
Published: (2025)
Random regular graph states are complex at almost any depth
by: Ghosh, Soumik, et al.
Published: (2024)
by: Ghosh, Soumik, et al.
Published: (2024)
Arts & crafts: Strong random unitaries and geometric locality
by: Folkertsma, Marten, et al.
Published: (2026)
by: Folkertsma, Marten, et al.
Published: (2026)
Mutual information fluctuations and non-stabilizerness in random circuits
by: Ahmadi, Arash, et al.
Published: (2024)
by: Ahmadi, Arash, et al.
Published: (2024)
Catalytic entanglement transformations with noisy hardware
by: Sharma, Hemant, et al.
Published: (2025)
by: Sharma, Hemant, et al.
Published: (2025)
On Groups in the Qubit Clifford Hierarchy
by: Anderson, Jonas T.
Published: (2022)
by: Anderson, Jonas T.
Published: (2022)
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality
by: Bao, Zongbo, et al.
Published: (2023)
by: Bao, Zongbo, et al.
Published: (2023)
Upper bound hierarchies for noncommutative polynomial optimization
by: Klep, Igor, et al.
Published: (2024)
by: Klep, Igor, et al.
Published: (2024)
Controlled Gates in the Clifford Hierarchy
by: Anderson, Jonas T., et al.
Published: (2024)
by: Anderson, Jonas T., et al.
Published: (2024)
Affine Equivalence in the Clifford Hierarchy
by: Anderson, Jonas T., et al.
Published: (2025)
by: Anderson, Jonas T., et al.
Published: (2025)
Minimising the number of edges in LC-equivalent graph states
by: Sharma, Hemant, et al.
Published: (2025)
by: Sharma, Hemant, et al.
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)
by: Dasu, Shival, et al.
Published: (2026)
Will it glue? On short-depth designs beyond the unitary group
by: Grevink, Lorenzo, et al.
Published: (2025)
by: Grevink, Lorenzo, et al.
Published: (2025)
Efficient Non-Adaptive Quantum Algorithms for Tolerant Junta Testing
by: Bao, Zongbo, et al.
Published: (2025)
by: Bao, Zongbo, et al.
Published: (2025)
Symmetric quantum computation
by: Castro-Silva, Davi, et al.
Published: (2025)
by: Castro-Silva, Davi, et al.
Published: (2025)
A Rubik's Cube inspired approach to Clifford synthesis
by: Bao, Ning, et al.
Published: (2023)
by: Bao, Ning, et al.
Published: (2023)
Experimental Efficient Influence Sampling of Quantum Processes
by: Zhan, Hao, et al.
Published: (2025)
by: Zhan, Hao, et al.
Published: (2025)
Clifford synthesis via generalized S and CZ gates
by: Kliuchnikov, Vadym, et al.
Published: (2026)
by: Kliuchnikov, Vadym, et al.
Published: (2026)
CNOT-Optimal Clifford Synthesis as SAT
by: Shaik, Irfansha, et al.
Published: (2025)
by: Shaik, Irfansha, et al.
Published: (2025)
Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
by: Glaudell, Andrew N., et al.
Published: (2024)
by: Glaudell, Andrew N., et al.
Published: (2024)
The Clifford theory of the n-qubit Clifford group
by: Mastel, Kieran
Published: (2023)
by: Mastel, Kieran
Published: (2023)
Similar Items
-
Clifford testing: algorithms and lower bounds
by: Hinsche, Marcel, et al.
Published: (2025) -
Tolerant testing of stabilizer states with a polynomial gap via a generalized uncertainty relation
by: Bao, Zongbo, et al.
Published: (2024) -
A near-optimal Quadratic Goldreich-Levin algorithm
by: Briët, Jop, et al.
Published: (2025) -
Random restrictions of high-rank tensors and polynomial maps
by: Briët, Jop, et al.
Published: (2022) -
On the threshold for Szemerédi's theorem with random differences
by: Briët, Jop, et al.
Published: (2023)