Imagen de Portada

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Iyer, Vishnu, Jain, Siddhartha, Jordan, Stephen, Somma, Rolando
Formato:	Preprint
Publicado:	2026
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Efficient Quantum Hermite Transform
por: Jain, Siddhartha, et al.
Publicado: (2025)

On the Rational Degree of Boolean Functions and Applications
por: Iyer, Vishnu, et al.
Publicado: (2023)

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

Optimising quantum circuits is generally hard
por: van de Wetering, John, et al.
Publicado: (2023)

Exact spectral gaps of random one-dimensional quantum circuits
por: Deneris, Andrew E., et al.
Publicado: (2024)

Bell sampling from quantum circuits
por: Hangleiter, Dominik, et al.
Publicado: (2023)

Pseudoentanglement Ain't Cheap
por: Grewal, Sabee, et al.
Publicado: (2024)

Classically estimating observables of noiseless quantum circuits
por: Angrisani, Armando, et al.
Publicado: (2024)

Classical simulability of quantum circuits followed by sparse classical post-processing
por: Takahashi, Yasuhiro, et al.
Publicado: (2026)

Learning junta distributions, quantum junta states, and QAC$^0$ circuits
por: Bao, Jinge, et al.
Publicado: (2024)

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

Complexity of quantum circuits via sensitivity, magic, and coherence
por: Bu, Kaifeng, et al.
Publicado: (2022)

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
por: Barthe, Alice, et al.
Publicado: (2024)

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

Quantum Communication Advantage in TFNP
por: Göös, Mika, et al.
Publicado: (2024)

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

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

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
por: Aaronson, Scott, et al.
Publicado: (2024)

On the average-case complexity of learning output distributions of quantum circuits
por: Nietner, Alexander, et al.
Publicado: (2023)

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

Learning depth-3 circuits via quantum agnostic boosting
por: Arunachalam, Srinivasan, et al.
Publicado: (2025)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
por: Grewal, Sabee, et al.
Publicado: (2022)

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$
por: Yao, Penghui, et al.
Publicado: (2023)

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

Exponential speedups in fault-tolerant processing of quantum experiments
por: Kannan, Ishaan, et al.
Publicado: (2026)

Quasi-quantum states and the quasi-quantum PCP theorem
por: Arad, Itai, et al.
Publicado: (2024)

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

Improved Stabilizer Estimation via Bell Difference Sampling
por: Grewal, Sabee, et al.
Publicado: (2023)

Classical versus quantum queries in quantum PCPs with classical proofs
por: Buhrman, Harry, et al.
Publicado: (2024)

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
por: Wadhwa, Chirag, et al.
Publicado: (2024)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
por: Anand, Kartik, et al.
Publicado: (2025)

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

Symmetric quantum computation
por: Castro-Silva, Davi, et al.
Publicado: (2025)

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

A polynomial-time classical algorithm for noisy quantum circuits
por: Schuster, Thomas, et al.
Publicado: (2024)

The 7 faces of quantum NP
por: Gharibian, Sevag
Publicado: (2023)

Improved quantum data analysis
por: Bădescu, Costin, et al.
Publicado: (2020)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
por: Gall, François Le, et al.
Publicado: (2023)

IQP circuits for 2-Forrelation
por: Buzet, Quentin, et al.
Publicado: (2026)

Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
por: Panova, Greta
Publicado: (2025)