How much classical data to send a qubit? Lund University has a measure

Understand this faster with AI
Researchers at Lund University have determined that the amount of classical information needed to accurately simulate quantum states increases exponentially as the system grows. The work establishes a direct link between “classical complexity”, a measure of how difficult it is to classically describe a quantum state, and the amount of classical communication required to replicate quantum correlations in experiments. This reveals a rapidly scaling cost for classical simulation of quantum systems.
The team has developed methods to certify this complexity in quantum preparation devices, scaling convex programming up to thousands of qubit states. The results establish classical complexity as a fundamental measure of quantum communication advantage, revealing the intrinsic cost of classically simulating quantum theory and providing practical tools for its certification.
Classical Complexity Defines Quantum State Transmission Cost This finding establishes a fundamental limit to how efficiently classical computers can simulate quantum systems, and introduces a new metric, classical complexity, to quantify that limitation. Researchers demonstrated that this complexity directly corresponds to the classical communication required to simulate quantum correlations in prepare-and-broadcast experiments, framing it as a resource equivalent to the quantum information itself.
This research moves beyond simply identifying a theoretical advantage for quantum communication. It provides a way to measure the cost of classically emulating quantum state transmission.
The team defined classical complexity as the minimum size of the classical message alphabet needed to reproduce quantum states, and proved this metric benchmarks quantum communication advantage independently of any specific task. This differs from previous work focusing on quantum reductions in communication complexity, which assessed advantage relative to a defined classical input-output scenario. The framework developed allows for a task-independent assessment of quantum advantage, focusing directly on the quantum states being transmitted. To quantify this cost, the researchers developed a suite of tools for certifying classical complexity in quantum preparation devices, including a semidefinite-programming characterisation and analytical witnesses for symmetric preparations. These methods are scalable, capable of handling simulations of quantum states with hundreds, and in some cases thousands, of qubits. “Classical complexity benchmarks the advantage of quantum communication by quantifying the classical resources required to reproduce quantum state transmission itself,” explained Elna Svegborn of the Physics Department and NanoLund at Lund University.
The team’s work also reveals that classical complexity grows as a power-law in inverse noise, meaning that noisier quantum states require proportionally less classical information to simulate. This suggests that while noise degrades the quantum signal, it simultaneously reduces the burden on classical simulation.
The team proved that a classical communication model with a certain complexity guarantees the ability to reproduce all correlations obtained by measuring the transmitted quantum states. This equivalence establishes classical complexity not just as a theoretical property, but as a quantifiable resource defining the cost of classical emulation of quantum communication. The research provides a new lens through which to assess the potential of quantum technologies, by directly quantifying the classical resources required to achieve quantum advantages. Prepare-and-Broadcast Equivalence Links Complexity to Quantum Correlations The research establishes a direct equivalence between the difficulty of sending a quantum state and the difficulty of recreating its measurable effects, a finding that reframes classical complexity as a quantifiable resource. This equivalence moves beyond theoretical properties, establishing a concrete relationship between quantum transmission and the reproduction of quantum behavior. This growth contrasts sharply with standard prepare-and-measure scenarios, where simulating quantum correlations requires an unbounded classical message alphabet only when the dimension reaches four or more. In prepare-and-broadcast experiments, however, an infinite cost arises even for qubits, highlighting a fundamental limit to classical emulation of quantum communication. This counterintuitive relationship suggests a trade-off between signal quality and simulation difficulty, offering new insights into the interplay between quantum coherence and classical representation. These tools provide a practical means of assessing the inherent limitations of classical simulation for specific quantum systems. Exponential Scaling of Complexity with Quantum Dimension Scalable linear-programming methods allow characterisation of quantum state sets containing hundreds and sometimes thousands of states, a feat previously limited to smaller systems. These methods provide a means to certify classical complexity, the minimum cost of classical communication needed to simulate quantum preparations, for a significantly larger number of quantum states than previously possible. Specifically, the research demonstrates that complexity grows exponentially with the quantum dimension and as a power-law in the inverse noise.
Classical Complexity Benchmarks Quantum Communication Advantage Convex programming methods allow certification of classical complexity for quantum preparation devices with up to hundreds and sometimes thousands of qubit states. This analytical toolkit, developed by researchers, includes an exact semidefinite-programming characterisation alongside analytical witnesses for symmetric preparations, offering a practical means to assess the difficulty of classically simulating specific quantum states. The ability to scale these methods to larger qubit numbers represents a step toward understanding the limits of classical simulation. This connection moves beyond simply quantifying the cost of simulation. The researchers state, highlighting the reciprocal relationship between simulation and quantum advantage. This means that as the dimensionality of the quantum system increases, the amount of classical information required to describe it grows at an accelerating rate.
Semidefinite Programming Certifies Complexity in Quantum Preparation These techniques include analytical witnesses for symmetric preparations and linear programming that characterizes sets of states far exceeding the reach of standard semidefinite programming.
The team’s approach addresses a critical question: determining if a given set of quantum states aligns with a specific classical communication model. Compatibility is assessed using an exact semidefinite programming characterisation, though its computational demands rapidly increase with the number of states, dimension and the complexity itself. To circumvent this, the researchers devised complementary methods, including analytical criteria for highly symmetric preparations applicable in any dimension. This allows for efficient certification of classical complexity in scenarios where traditional methods become intractable. For qubit preparations, the developed scalable linear-programming methods yield near-exact characterizations for sets containing hundreds, and sometimes thousands, of states. This advancement is particularly significant because it moves beyond simply defining classical complexity as a theoretical property. The researchers note that, unlike some models, the classical complexity of a set of states can be unbounded as the number of states increases. They also highlight that the separation between quantum and classical disappears when considering broader scenarios, revealing the full power of quantum correlations without additional assumptions.
Analytical Witnesses Detect Symmetric Preparation Complexity The ability to efficiently certify the classical complexity of quantum preparation devices now extends to systems containing hundreds and sometimes thousands of qubit states, thanks to newly developed analytical tools. These analytical witnesses offer a pathway to experimentally verify classical complexity, focusing on devices designed to prepare mutually unbiased bases or equiangular tight frames. This approach contrasts with methods focused solely on state generation without superposition, instead concentrating on the resources needed for quantum state transmission. This certification is not merely theoretical; the convex programming methods developed are scalable, enabling analysis of systems far exceeding the reach of standard computational techniques.
Scalable Linear Programming Characterizes Qubit State Complexity These new tools allow researchers to move past the computational bottlenecks of standard semidefinite programming, which quickly become impractical as the number of states increases. This certification is not limited to small ensembles; the methods developed provide near-exact characterizations for sets containing several hundreds of states, and in some cases, extending into the thousands. This scalability stems from a focus on convex programming techniques, allowing for efficient analysis even as the complexity of the quantum system grows. For example, the classical complexity remains constant even when a set of states is expanded indefinitely with convex combinations of its members. The scalability bottleneck arises from the exponential growth in the number of possible compression strategies within the classical communication model as the ensemble size increases. 👉 More information🗞 The classical complexity of quantum state transmission✍️ Elna Svegborn, Alexander Bernal and Armin Tavakoli (Physics Department and NanoLund, Lund University, Box 118, Lund, Sweden.)🧠 ArXiv: https://arxiv.org/abs/2611.26126v1 More like thisQuantum HardwareLiquid metals pass the test for linking quantum modules at 15 millikelvinQuantum PhysicsScientists link photon antibunching to quantum entanglementQuantum Error CorrectionResearchers stitch quantum codes together without extra qubitsQuantum PhysicsA new circuit reverses the standard quantum Zeno probabilityStay currentSee today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals. Tags:
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
