Imagen de Portada

DQC1-hardness of estimating correlation functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Moulik, Subhayan Roy, Strelchuk, Sergii
Formato:	Preprint
Publicado:	2024
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

DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
por: Ji, Zhengfeng, et al.
Publicado: (2026)

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

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

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

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

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

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)

Exponential improvements to the average-case hardness of BosonSampling
por: Bouland, Adam, et al.
Publicado: (2024)

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

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

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

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

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)

The membership problem for constant-sized quantum correlations is undecidable
por: Fu, Honghao, et al.
Publicado: (2021)

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

Distributed inner product estimation with limited quantum communication
por: Arunachalam, Srinivasan, et al.
Publicado: (2024)

On the complexity of estimating ground state entanglement and free energy
por: Gharibian, Sevag, et al.
Publicado: (2025)

Beating the natural Grover bound for low-energy estimation and state preparation
por: Buhrman, Harry, et al.
Publicado: (2024)

Quantum computational complexity of matrix functions
por: Cifuentes, Santiago, et al.
Publicado: (2024)

On query complexity measures and their relations for symmetric functions
por: Mittal, Rajat, et al.
Publicado: (2021)

Quantum and classical query complexities of functions of matrices
por: Montanaro, Ashley, et al.
Publicado: (2023)

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

Improved separation between quantum and classical computers for sampling and functional tasks
por: Marshall, Simon C., et al.
Publicado: (2024)

Measuring Butterfly Velocity in the XY Model on Emerging Quantum Computers
por: McCartney, Calum, et al.
Publicado: (2024)

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

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
por: Lemus, Mariano, et al.
Publicado: (2023)

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

Topics in Non-local Games: Synchronous Algebras, Algebraic Graph Identities, and Quantum NP-hardness Reductions
por: He, Entong
Publicado: (2024)

On the hardness of learning ground state entanglement of geometrically local Hamiltonians
por: Bouland, Adam, et al.
Publicado: (2024)

Strassen's support functionals coincide with the quantum functionals
por: Sakabe, Keiya, et al.
Publicado: (2026)

Simultaneous superadditivity of the direct and complementary channel capacities
por: Singh, Satvik, et al.
Publicado: (2023)

Learning Gaussian Operations and the Matchgate Hierarchy
por: Cudby, Joshua, et al.
Publicado: (2024)

A Lightweight Protocol for Matchgate Fidelity Estimation
por: Burkat, Jędrzej, et al.
Publicado: (2024)

Parameterized quantum algorithms for closest string problems
por: Cudby, Josh, et al.
Publicado: (2025)

Flexible Catalysis
por: Weisz, Máté, et al.
Publicado: (2025)

Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform
por: Wills, Adam, et al.
Publicado: (2023)

Gaussian decomposition of magic states for matchgate computations
por: Cudby, Joshua, et al.
Publicado: (2023)

Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly
por: Cudby, Josh, et al.
Publicado: (2026)

Structure, Positivity and Classical Simulability of Kirkwood-Dirac Distributions
por: Burkat, Jędrzej, et al.
Publicado: (2025)