Imagen de Portada

Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Incudini, Massimiliano, Gyurik, Casper, Molteni, Riccardo, Dunjko, Vedran
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exponential quantum advantages in learning quantum observables from classical data
por: Molteni, Riccardo, et al.
Publicado: (2024)

Exponential separations between classical and quantum learners
por: Gyurik, Casper, et al.
Publicado: (2023)

Shadows of quantum machine learning
por: Jerbi, Sofiene, et al.
Publicado: (2023)

On Bounded Advice Classes
por: Marshall, Simon, et al.
Publicado: (2024)

Quantum machine learning advantages beyond hardness of evaluation
por: Molteni, Riccardo, et al.
Publicado: (2025)

Computational complexity of the homology problem with orientable filtration: MA-completeness
por: Hayakawa, Ryu, et al.
Publicado: (2025)

On the relation between trainability and dequantization of variational quantum learning models
por: Gil-Fuster, Elies, et al.
Publicado: (2024)

Quantum computing and persistence in topological data analysis
por: Gyurik, Casper, et al.
Publicado: (2024)

Gapped Clique Homology on weighted graphs is $\text{QMA}_1$-hard and contained in $\text{QMA}$
por: King, Robbie, et al.
Publicado: (2023)

Clique Homology is QMA1-hard
por: Crichigno, Marcos, et al.
Publicado: (2022)

Evidence of Quantum Machine Learning Advantage with Tens of Noisy Qubits
por: Danaci, Onur, et al.
Publicado: (2026)

Analyzing Prospects for Quantum Advantage in Topological Data Analysis
por: Berry, Dominic W., et al.
Publicado: (2022)

Weighted Approximate Quantum Natural Gradient for Variational Quantum Eigensolver
por: Shi, Chenyu, et al.
Publicado: (2025)

${\sf QMA}={\sf QMA}_1$ with an infinite counter
por: Jeffery, Stacey, et al.
Publicado: (2025)

Differential equation quantum solvers: engineering measurements to reduce cost
por: Paine, Annie, et al.
Publicado: (2025)

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

Error and Resource Estimates of Variational Quantum Algorithms for Solving Differential Equations Based on Runge-Kutta Methods
por: Dechant, David, et al.
Publicado: (2024)

Machine learning with minimal use of quantum computers: Provable advantages in Learning Under Quantum Privileged Information (LUQPI)
por: Bokov, Vasily, et al.
Publicado: (2026)

Approximation and Generalization Capacities of Parametrized Quantum Circuits for Functions in Sobolev Spaces
por: Manzano, Alberto, et al.
Publicado: (2023)

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

On the expressivity of embedding quantum kernels
por: Gil-Fuster, Elies, et al.
Publicado: (2023)

Multiple-basis representation of quantum states
por: Pérez-Salinas, Adrián, et al.
Publicado: (2024)

Quantum Advantage in Learning Quantum Dynamics via Fourier coefficient extraction
por: Barthe, Alice, et al.
Publicado: (2025)

Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines
por: Shen, Kevin, et al.
Publicado: (2026)

Universal approximation of continuous functions with minimal quantum circuits
por: Pérez-Salinas, Adrián, et al.
Publicado: (2024)

Parameterized quantum circuits as universal generative models for continuous multivariate distributions
por: Barthe, Alice, et al.
Publicado: (2024)

Note on the Universality of Parameterized IQP Circuits with Hidden Units for Generating Probability Distributions
por: Kurkin, Andrii, et al.
Publicado: (2025)

Universality and kernel-adaptive training for classically trained, quantum-deployed generative models
por: Kurkin, Andrii, et al.
Publicado: (2025)

Detecting underdetermination in parameterized quantum circuits
por: Kempkes, Marie, et al.
Publicado: (2025)

Trainability maximization using estimation of distribution algorithms assisted by surrogate modelling for quantum architecture search
por: Soloviev, Vicente P., et al.
Publicado: (2024)

Reinforcement Learning Assisted Recursive QAOA
por: Patel, Yash J., et al.
Publicado: (2022)

Limits to black-box amplification in QMA
por: Aaronson, Scott, et al.
Publicado: (2025)

Universality of Classically Trainable, Quantum-Deployed Boson-Sampling Generative Models
por: Kurkin, Andrii, et al.
Publicado: (2026)

Towards a universal gateset for $\mathsf{QMA}_1$
por: Rudolph, Dorian
Publicado: (2024)

Two bases suffice for QMA1-completeness
por: Ma, Henry, et al.
Publicado: (2025)

QMA vs. QCMA and Pseudorandomness
por: Liu, Jiahui, et al.
Publicado: (2024)

Variational Quantum Generative Modeling by Sampling Expectation Values of Tunable Observables
por: Shen, Kevin, et al.
Publicado: (2024)

The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning
por: Incudini, Massimiliano, et al.
Publicado: (2022)

Resource Saving via Ensemble Techniques for Quantum Neural Networks
por: Incudini, Massimiliano, et al.
Publicado: (2023)

Superposition detection and QMA with non-collapsing measurements
por: Bassirian, Roozbeh, et al.
Publicado: (2024)