Cover Image

Efficient approximate unitary designs from random Pauli rotations

Fuente: arXiv

Saved in:

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

Similar Items

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

Short remarks on shallow unitary circuits
by: Haah, Jeongwan
Published: (2025)

Topological phases of unitary dynamics: Classification in Clifford category
by: Haah, Jeongwan
Published: (2022)

Growth and collapse of subsystem complexity under random unitary circuits
by: Haah, Jeongwan, et al.
Published: (2025)

Unitary synthesis with fewer T gates
by: Tan, Xinyu
Published: (2025)

On the Pauli Spectrum of QAC0
by: Nadimpalli, Shivam, et al.
Published: (2023)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
by: Acharya, Jayadev, et al.
Published: (2025)

Learning quantum states prepared by shallow circuits in polynomial time
by: Landau, Zeph, et al.
Published: (2024)

Hardness results for decoding the surface code with Pauli noise
by: Fischer, Alex, et al.
Published: (2023)

The code distance of Floquet codes
by: Blackwell, Keller, et al.
Published: (2025)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
by: Sarkar, Rohit Sarma, et al.
Published: (2024)

Query-optimal estimation of unitary channels in diamond distance
by: Haah, Jeongwan, et al.
Published: (2023)

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

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

Learning unitaries with quantum statistical queries
by: Angrisani, Armando
Published: (2023)

Hardness of approximation for ground state problems
by: Gharibian, Sevag, et al.
Published: (2024)

Are controlled unitaries helpful?
by: Tang, Ewin, et al.
Published: (2025)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
by: Nelson, Jon, et al.
Published: (2025)

Random ensembles of symplectic and unitary states are indistinguishable
by: West, Maxwell, et al.
Published: (2024)

Low-degree approximation of QAC$^0$ circuits
by: Montanaro, Ashley, et al.
Published: (2024)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)

On the complexity of unique quantum witnesses and quantum approximate counting
by: Anshu, Anurag, et al.
Published: (2024)

Strong random unitaries and fast scrambling
by: Schuster, Thomas, et al.
Published: (2025)

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

BQP, meet NP: Search-to-decision reductions and approximate counting
by: Gharibian, Sevag, et al.
Published: (2024)

Efficient Pauli channel estimation with logarithmic quantum memory
by: Chen, Sitan, et al.
Published: (2023)

Quantum advantage from random geometrically-two-local Hamiltonian dynamics
by: Quek, Yihui
Published: (2025)

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
by: Haug, Tobias, et al.
Published: (2023)

Verifiable measurement-based quantum random sampling with trapped ions
by: Ringbauer, Martin, et al.
Published: (2023)

Efficiently verifiable quantum advantage on near-term analog quantum simulators
by: Liu, Zhenning, et al.
Published: (2024)

Quantum advantage from measurement-induced entanglement in random shallow circuits
by: Watts, Adam Bene, et al.
Published: (2024)

Quantum search by continuous-time quantum walk on t-designs
by: Lugão, Pedro H. G., et al.
Published: (2023)

An Efficient Quantum Factoring Algorithm
by: Regev, Oded
Published: (2023)

Efficient Quantum Hermite Transform
by: Jain, Siddhartha, et al.
Published: (2025)

Efficient Algorithms for Quantum Hashing
by: Zinnatullin, Ilnar, et al.
Published: (2025)

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
by: Haah, Jeongwan, et al.
Published: (2021)

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

The role of shared randomness in quantum state certification with unentangled measurements
by: Liu, Yuhan, et al.
Published: (2024)