Imagen de Portada

Optimising quantum circuits is generally hard

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	van de Wetering, John, Amy, Matt
Formato:	Preprint
Publicado:	2023
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

Complexity and hardness of random peaked circuits
por: Zhang, Yuxuan
Publicado: (2025)

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

Exact Quantum Circuit Optimization is co-NQP-hard
por: Kjelstrøm, Adam Husted, et al.
Publicado: (2025)

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

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
por: Iyer, Vishnu, et al.
Publicado: (2026)

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
por: Hangleiter, Dominik, et al.
Publicado: (2024)

Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete problems and ${\mathord{\#}\mathrm P}$-hardness of circuit extraction in phase-free ZH
por: Mitosek, Piotr
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)

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

Approximating the quantum value of an LCS game is RE-hard
por: Taller, Aviv, et al.
Publicado: (2025)

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

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

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

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

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

On the hardness of cloning and connections to representation theory
por: Havlíček, Vojtěch, et al.
Publicado: (2024)

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

DQC1-hardness of estimating correlation functions
por: Moulik, Subhayan Roy, et al.
Publicado: (2024)

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

How hard is it to verify a classical shadow?
por: Karaiskos, Georgios, et al.
Publicado: (2025)

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

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

On estimating the entropy of shallow circuit outputs
por: Gheorghiu, Alexandru, et al.
Publicado: (2020)

Exponential improvements to the average-case hardness of BosonSampling
por: Bouland, Adam, 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)

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

Quantum circuit lower bounds in the magic hierarchy
por: Parham, Natalie
Publicado: (2025)

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

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

Computational hardness of estimating quantum entropies via binary entropy bounds
por: Liu, Yupan
Publicado: (2026)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
por: Rayudu, Chaithanya
Publicado: (2024)

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
por: Hsieh, Min-Hsiu, et al.
Publicado: (2024)

Quantum precomputation: parallelizing cascade circuits and the Moore-Nilsson conjecture is false
por: Watts, Adam Bene, et al.
Publicado: (2025)

The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
por: Gu, Shouzhen, et al.
Publicado: (2026)

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

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

A polynomial-time classical algorithm for noisy quantum circuits
por: Schuster, Thomas, 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)