Imagen de Portada

Using 1-Factorization from Graph Theory for Quantum Speedups on Clique Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Moghadam, Ali Hadizadeh, Kazemikhah, Payman, Aghababa, Hossein
Formato:	Preprint
Publicado:	2023
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum-Efficient Convolution through Sparse Matrix Encoding and Low-Depth Inner Product Circuits
por: Roshanshah, Mohammad Rasoul, et al.
Publicado: (2025)

XpookyNet: Advancement in Quantum System Analysis through Convolutional Neural Networks for Detection of Entanglement
por: Kookani, Ali, et al.
Publicado: (2023)

Non-unitary Quantum Physical Unclonable Functions: Modelling, Simulation, and Evaluation under Open Quantum Dynamics
por: Vali, Mohammadreza, et al.
Publicado: (2025)

Gate Optimization of NEQR Quantum Circuits via PPRM Transformation
por: Iranmanesh, Shahab, et al.
Publicado: (2024)

Generalization of Bidirectional Controlled Hybrid Protocol of Quantum Teleportation and Remote State Preparation
por: Valeh, MohammadHossein, et al.
Publicado: (2025)

Quantum Speedup of the Dispersion and Codebook Design Problems
por: Yukiyoshi, Kein, et al.
Publicado: (2024)

Generation and Teleportation of three and four particle W state
por: Chobari, Seyed Amir hossein Mehrinezhad, et al.
Publicado: (2025)

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
por: Singkanipa, P., et al.
Publicado: (2024)

Quadratic Quantum Speedup for Finding Independent Set of a Graph
por: Zhao, Xianjue, et al.
Publicado: (2025)

Multidimensional Electrical Networks and their Application to Exponential Speedups for Graph Problems
por: Li, Jianqiang, et al.
Publicado: (2023)

Quantum Speedups for Multiproposal MCMC
por: Lin, Chin-Yi, et al.
Publicado: (2023)

Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
por: Pelofske, Elijah, et al.
Publicado: (2022)

Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups
por: Schuetz, Martin J. A., et al.
Publicado: (2024)

Demonstration of Exponential Quantum Speedup with Constant-Depth Compiled Circuits for Simon's Problem
por: Singkanipa, Phattharaporn, et al.
Publicado: (2026)

Quantum Decoding Algorithms: Quantum Speedups in Optimization
por: Ljubas, Jan, et al.
Publicado: (2026)

The Physical and Contextual Limits of Quantum Speedup
por: Svozil, Karl
Publicado: (2026)

Quadratic Quantum Speedup for Perceptron Training
por: Liao, Pengcheng, et al.
Publicado: (2021)

Hardness of the Maximum Independent Set Problem on Unit-Disk Graphs and Prospects for Quantum Speedups
por: Andrist, Ruben S., et al.
Publicado: (2023)

Quantum Speedup for Nonreversible Markov Chains
por: Claudon, Baptiste, et al.
Publicado: (2025)

Tuning for Quantum Speedup in Directed Lackadaisical Quantum Walks
por: Naredi, Pranay, et al.
Publicado: (2022)

An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem
por: Gherardi, Alessandro, et al.
Publicado: (2024)

Quantum Speedup for Hypergraph Sparsification
por: Liu, Chenghua, et al.
Publicado: (2025)

From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
por: Escrig, Gabriel, et al.
Publicado: (2026)

Quantum Speedup for Network Coordination via Fourier Sparsity
por: Dixit, Vinayak
Publicado: (2026)

Exponential Quantum Speedup for Simulating Classical Lattice Dynamics
por: Li, Xiantao
Publicado: (2025)

Towards Entropic Constraints on Quantum Speedups
por: Pollack, Jason, et al.
Publicado: (2024)

Speedup Chip Yield Analysis by Improved Quantum Bayesian Inference
por: Li, Zi-Ming, et al.
Publicado: (2025)

Quantum Speedup in Dissecting Roots and Solving Nonlinear Algebraic Equations
por: Nghiem, Nhat A.
Publicado: (2025)

Correlated Optical Convolutional Neural Network with Quantum Speedup
por: Sun, Yifan, et al.
Publicado: (2024)

Compositional Quantum Heuristics for Max-Clique Detection
por: Duneau, Tiffany, et al.
Publicado: (2026)

(Sub)Exponential Quantum Speedup for Optimization
por: Leng, Jiaqi, et al.
Publicado: (2025)

Quantum Speedups for Bayesian Network Structure Learning
por: Harviainen, Juha, et al.
Publicado: (2023)

Quantum Speedup for Sampling Random Spanning Trees
por: Apers, Simon, et al.
Publicado: (2025)

From Promises to Totality: A Framework for Ruling Out Quantum Speedups
por: Huffstutler, Thomas, et al.
Publicado: (2026)

Exponential Quantum Speedup on Structured Hard Instances of Maximum Independent Set
por: Choi, Vicky
Publicado: (2026)

Exponential Quantum Speedup for Simulation-Based Optimization Applications
por: Stein, Jonas, et al.
Publicado: (2023)

Quantum Speedup for Spectral Approximation of Kronecker Products
por: Gao, Yeqi, et al.
Publicado: (2024)

Quantum Speedup for Polar Maximum Likelihood Decoding
por: Fujiwara, Shintaro, et al.
Publicado: (2024)

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

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
por: Caroppo, Susanna, et al.
Publicado: (2025)