Skip to content
aiqbenchAI & Quantum Intelligence
NewsInsightsBenchmarksSkillsAsk AILearnAbout
...Loading your session
NewsInsightsBenchmarksSkillsAsk AILearnAbout
Back to list
aiqbench takeQuantum Computing

aiqbench analysis

This paper advances the theoretical understanding of Ising and Clifford quantum computers by extending classical simulation limits from braidings to measurements. It establishes rigorous complexity class separations between P and PSPACE under specific circuit generator assumptions, clarifying the computational boundaries of these models.
1
Source coveringarXiv

Computational Power of Clifford and Ising Quantum Computers

arXiv·November 11, 2026·1 min read

From arXiv

Full text

arXiv:2611.13347v1 Announce Type: new Abstract: We extend the efficient classical simulation of Ising quantum computers from braidings to measurements. We investigate several different definitions of efficient Clifford quantum computation by varying the power of the circuit generator. In case the circuit generator can see the entire input, we give a detailed proof that efficient simulation of classical computation would imply the separation of complexity classes $\mathbf{P}$ and $\mathbf{PSPACE}$. If the circuit generator sees only the input length, we prove that Clifford quantum computers decide what we call affine languages.

Abstract:We extend the efficient classical simulation of Ising quantum computers from braidings to measurements. We investigate several different definitions of efficient Clifford quantum computation by varying the power of the circuit generator. In case the circuit generator can see the entire input, we give a detailed proof that efficient simulation of classical computation would imply the separation of complexity classes $\mathbf{P}$ and $\mathbf{PSPACE}$. If the circuit generator sees only the input length, we prove that Clifford quantum computers decide what we call affine languages.

Quantum Physics (quant-ph); Computational Complexity (cs.CC); Quantum Algebra (math.QA)

arXiv:2611.13347 [quant-ph]

(or arXiv:2611.13347v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2611.13347 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 184 words

Read at arXiv ↗Ask about this article

Related coverage

AI Research

Large language models for computational social science

Nature · Oct 26, 2026

Quantum Computing

News Archive 2026

Quantum Computing Report · Jul 25, 2026

AI Safety

Pacing AI via Compute Reallocation

AI Futures Project · Nov 18, 2026

Quantum Computing

News

Quantum Computing Report · Jun 7, 2026

Article info

Source

arXiv

Published

November 11, 2026

Read time

1 min

Category

Quantum Computing
aiqbench
AI & Quantum Intelligence© aiqbench. All rights reserved.

Feeds:RSS·JSON Feed

LanguageEnglish·Românăbeta
NewsAI & TechQuantumInsights
ExploreBenchmarksLearn
CompanyAboutTrustLegal noticeTerms of ServicePrivacy PolicyCopyright noticesData erasureReport content

The aiqbench take, the insights, the daily digest and Ask answers are written by AI models from the sources shown, without editorial review before publication. They may contain errors — check the source. How the model is used →

  • News
  • Insights
  • Ask AI
  • Benchmarks
  • Account