--- title: 3D-local noisy shallow quantum circuits defeat unbounded... description: Researchers present a computational problem solvable with near-certainty by a constant-depth quantum circuit using only 3D-local operations, even in the... canonical: https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse twitter:card: summary_large_image twitter:site: @dailydotdev og:type: website og:site_name: daily.dev og:title: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits | daily.dev og:description: Researchers present a computational problem solvable with near-certainty by a constant-depth quantum circuit using only 3D-local operations, even in the... og:url: https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse og:image: https://api.daily.dev/og/posts/fCzOswTse.png og:image:alt: 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits og:image:width: 1200 og:image:height: 630 og:locale: en --- > ## Documentation Index > Fetch the complete documentation index at: https://daily.dev/llms.txt > Use this file to discover all available pages before exploring further. # 3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits **[Nature](https://daily.dev/sources/nature)** · 3 min read · 0 upvotes · 0 comments ## Summary Researchers present a computational problem solvable with near-certainty by a constant-depth quantum circuit using only 3D-local operations, even in the presence of noise. No classical AC0 circuit smaller than a certain subexponential size can solve the same problem on a uniformly random instance. This result establishes the strongest known complexity-theoretic separation between classical and quantum computation that is experimentally observable without requiring full fault-tolerance, making it relevant for NISQ-era devices. ## Full article daily.dev links to this article rather than hosting it. Read it at the original source: ## Questions this post answers ### What is the strongest known complexity-theoretic separation between classical and quantum computation that can be demonstrated experimentally? A constant-depth quantum circuit with 3D-local operations can solve a specific search problem with near-certainty even under noise, while every classical AC0 circuit (unbounded fan-in) smaller than a subexponential size fails with near-certainty on a uniformly random instance. This separation is notable because it does not rely on unproven hardness assumptions and does not require a universal fault-tolerant quantum computer. _Quantum computing researchers tracking provable advantage results follow developments like this on daily.dev._ ## Similar posts on daily.dev - [Limitations of noisy quantum devices in computing and entangling power](https://daily.dev/posts/limitations-of-noisy-quantum-devices-in-computing-and-entangling-power-kdi7n00dx) · Nature · 0 upvotes · 0 comments - [Noise-induced shallow circuits and the absence of barren plateaus](https://daily.dev/posts/noise-induced-shallow-circuits-and-the-absence-of-barren-plateaus-ppkdofabv) · Nature · 0 upvotes · 0 comments - [Has quantum advantage been achieved? Part 2: Considering the evidence](https://daily.dev/posts/has-quantum-advantage-been-achieved-part-2-considering-the-evidence-tlsub1wyo) · Quantum Frontiers · 0 upvotes · 0 comments - [Demonstrating quantum error mitigation on logical qubits](https://daily.dev/posts/demonstrating-quantum-error-mitigation-on-logical-qubits-jgicy98kf) · Nature · 0 upvotes · 0 comments - [Quantum circuit complexity and unsupervised machine learning of topological order](https://daily.dev/posts/quantum-circuit-complexity-and-unsupervised-machine-learning-of-topological-order-2ohh01qj4) · Nature · 0 upvotes · 0 comments --- Tags: [#quantum-computing](https://daily.dev/tags/quantum-computing) [View this post on daily.dev](https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse) ```json {"@context":"https://schema.org","@graph":[{"@type":"Organization","@id":"https://daily.dev/#organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180},"sameAs":["https://twitter.com/dailydotdev","https://github.com/dailydotdev","https://www.linkedin.com/company/daily-dev-ltd"]},{"@type":"WebSite","@id":"https://daily.dev/#website","url":"https://daily.dev","name":"daily.dev","publisher":{"@id":"https://daily.dev/#organization"},"potentialAction":{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https://daily.dev/search?q={search_term_string}"},"query-input":"required name=search_term_string"}}]} {"@context":"https://schema.org","@type":"TechArticle","headline":"3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits","url":"https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse","mainEntityOfPage":{"@type":"WebPage","@id":"https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse"},"datePublished":"2026-08-11T10:32:46.215Z","dateModified":"2026-08-11T10:33:08.563Z","description":"Researchers present a computational problem solvable with near-certainty by a constant-depth quantum circuit using only 3D-local operations, even in the...","image":"https://media.daily.dev/image/upload/s--2-1xRawN--/f_auto/v1722860399/public/Placeholder%2011","thumbnailUrl":"https://media.daily.dev/image/upload/s--2-1xRawN--/f_auto/v1722860399/public/Placeholder%2011","isAccessibleForFree":true,"articleSection":"Nature","inLanguage":"en","publisher":{"@type":"Organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180}},"author":{"@type":"Organization","name":"Nature","logo":"https://media.daily.dev/image/upload/t_logo,f_auto/v1/logos/c263038828ce4ac283ed3ffebfed20c1","url":"https://daily.dev/sources/nature"},"commentCount":0,"discussionUrl":"https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse","interactionStatistic":[{"@type":"InteractionCounter","interactionType":{"@type":"LikeAction"},"userInteractionCount":0},{"@type":"InteractionCounter","interactionType":{"@type":"CommentAction"},"userInteractionCount":0}],"keywords":"quantum-computing","timeRequired":"PT3M"} {"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https://daily.dev"},{"@type":"ListItem","position":2,"name":"Nature","item":"https://daily.dev/sources/nature"},{"@type":"ListItem","position":3,"name":"3D-local noisy shallow quantum circuits defeat unbounded fan-in classical circuits"}]} {"@context":"https://schema.org","@type":"FAQPage","@id":"https://daily.dev/posts/3d-local-noisy-shallow-quantum-circuits-defeat-unbounded-fan-in-classical-circuits-fczoswtse#faq","mainEntity":[{"@type":"Question","name":"What is the strongest known complexity-theoretic separation between classical and quantum computation that can be demonstrated experimentally?","acceptedAnswer":{"@type":"Answer","text":"A constant-depth quantum circuit with 3D-local operations can solve a specific search problem with near-certainty even under noise, while every classical AC0 circuit (unbounded fan-in) smaller than a subexponential size fails with near-certainty on a uniformly random instance. This separation is notable because it does not rely on unproven hardness assumptions and does not require a universal fault-tolerant quantum computer. Quantum computing researchers tracking provable advantage results follow developments like this on daily.dev."}}]} ```