Cover Image

Group Order is in QCMA

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gall, François Le, Nishimura, Harumichi, Thakkar, Dhara
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity Group Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups
by: Levet, Michael, et al.
Published: (2025)

Does there exist a quantum fingerprinting protocol without coherent measurements?
by: Hasegawa, Atsuya, et al.
Published: (2025)

The hidden subgroup problem for infinite groups
by: Kuperberg, Greg
Published: (2025)

A slightly improved upper bound for quantum statistical zero-knowledge
by: Gall, François Le, et al.
Published: (2025)

QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
by: Delavenne, Hugo, et al.
Published: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
by: Zhandry, Mark
Published: (2024)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
by: Gall, François Le
Published: (2024)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)

Multi-Prover Interactive Proof Systems with Leakage
by: Asadi, Vahid R., et al.
Published: (2026)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
by: Nosan, Klara, et al.
Published: (2021)

Dequantizing Short-Path Quantum Algorithms
by: Gall, François Le, et al.
Published: (2026)

Separating QMA from QCMA with a classical oracle
by: Bostanci, John, et al.
Published: (2025)

Orbit-blocking words in free groups
by: Koch-Hyde, Lucy, et al.
Published: (2025)

The complexity of knapsack problems in wreath products
by: Figelius, Michael, et al.
Published: (2020)

Some properties of Higman-Thompson monoids and digital circuits
by: Birget, J. C.
Published: (2024)

Complexity of some algorithmic problems in groups: a survey
by: Shpilrain, Vladimir
Published: (2024)

On the complexity of the word problem of the R. Thompson group V
by: Birget, J. C.
Published: (2022)

Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries
by: Gall, François Le, et al.
Published: (2024)

On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
by: Johnson, Dan, et al.
Published: (2025)

Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete
by: Hutton, Kiera, et al.
Published: (2025)

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

Dequantization and Hardness of Spectral Sum Estimation
by: Edenhofer, Roman, et al.
Published: (2025)

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
by: Mataraarachchi, Ranitha, et al.
Published: (2026)

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
by: Shen, Hanwen, et al.
Published: (2025)

Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs
by: Dikstein, Yotam, et al.
Published: (2024)

Improved Hardness Results for the Guided Local Hamiltonian Problem
by: Cade, Chris, et al.
Published: (2022)

Computational Complexity of Finding Subgroups of a Given Order
by: Lakshmanan, K.
Published: (2025)

The Identity Problem in the special affine group of $\mathbb{Z}^2$
by: Dong, Ruiwen
Published: (2023)

Remembering Mark Sapir
by: Birget, Jean-Camille, et al.
Published: (2024)

Obstruction theory and the complexity of counting group homomorphisms
by: Samperton, Eric, et al.
Published: (2026)

Efficient Compression in Semigroups
by: Thumm, Alexander, et al.
Published: (2026)

Distortion element in the automorphism group of a full shift
by: Callard, Antonin, et al.
Published: (2022)