Cover Image

Quantum walks through generalized graph composition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Cornelissen, Arjan
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity 68Q12 F.1.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum algorithms through graph composition
by: Cornelissen, Arjan
Published: (2025)

Quantum Sabotage Complexity
by: Cornelissen, Arjan, et al.
Published: (2024)

How to compute the volume in low dimension?
by: Cornelissen, Arjan, et al.
Published: (2025)

Explicit separations between randomized and deterministic Number-on-Forehead communication
by: Kelley, Zander, et al.
Published: (2023)

Distributed Exact Quantum Amplitude Amplification Algorithm for Arbitrary Quantum States
by: Zhou, Xu, et al.
Published: (2026)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
by: Hakoniemi, Tuomas, et al.
Published: (2024)

NP-hardness of p-adic linear regression
by: Baker, Gregory D.
Published: (2026)

The Quantum Query Complexity of Finding a Tarski Fixed Point on the 2D Grid
by: Phillips, Reed
Published: (2026)

An SoS Entropy Dichotomy via Windowed Hypercontractivity
by: Lela, Marko
Published: (2025)

Quantum Advantage in Computational Chemistry?
by: Gundlach, Hans, et al.
Published: (2025)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
by: Conneryd, Jonas, et al.
Published: (2025)

Quoridor is PSPACE-Complete
by: Drop, Marius, et al.
Published: (2026)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
by: Lela, Marko
Published: (2025)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
by: Lela, Marko
Published: (2025)

Tight Bounds on the Spooky Pebble Game: Recycling Qubits with Measurements
by: Kornerup, Niels, et al.
Published: (2021)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
by: Saffidine, Abdallah, et al.
Published: (2025)

CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
by: Bodnar, Levente
Published: (2024)

Hive is PSPACE-Hard
by: Andel, Daniël, et al.
Published: (2025)

Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)

Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
by: Rossman, Benjamin
Published: (2024)

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
by: von Liechtenstein, Maximilian R. P.
Published: (2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
by: Grochow, Joshua A., et al.
Published: (2025)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

On the Complexity of Determinations
by: Hellerstein, Joseph M.
Published: (2026)

On the computational complexity of Data Flow Analysis
by: Sood, Gaurav, et al.
Published: (2013)

A Grover-Based Quantum Algorithm for Solving Perfect Mazes via Fitness-Guided Search
by: Wu, Michelle L.
Published: (2025)

Pauli-structured preconditioning for quantum linear system solvers
by: Nie, Hantao, et al.
Published: (2026)

Character Complexity: A Novel Measure for Quantum Circuit Analysis
by: Shami, Daksh
Published: (2024)

Quantum Time-Space Tradeoffs for Matrix Problems
by: Beame, Paul, et al.
Published: (2024)

Separation of PSPACE and EXP
by: Czerwinski, Reiner
Published: (2021)

Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)

Quantum Deep Learning Still Needs a Quantum Leap
by: Gundlach, Hans, et al.
Published: (2025)

The Word Problem for Products of Symmetric Groups
by: Simon, Hans U.
Published: (2025)

NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework
by: Eua-anant, Pakapim, et al.
Published: (2025)

On Small-depth Frege Proofs for PHP
by: Håstad, Johan
Published: (2024)

How do humans succeed in tasks like proving Fermat's Theorem or predicting the Higgs boson?
by: Levin, Leonid A.
Published: (2022)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
by: Xia, Mingji
Published: (2026)