Researchers Characterise Classically Simulable Quantum States with New Hierarchy

A qutrit mutually unbiased basis (MUB) family now benefits from a thorough semidefinite-programming (SDP) hierarchy, offering a systematic way to verify whether a family of quantum states can be explained by classical means. Until now, identifying classically simulable state families relied on limited numerical searches, but Mengyan Li of the Beijing University of Posts and Telecommunications and colleagues have achieved a complete hierarchy characterising these families in any finite dimension. This new framework reformulates classical simulability as a feasibility problem, utilising deterministic response functions and positive-operator-valued measures simulable by rank-one projective measurements.

Mengyan Li and colleagues have created a new set of tools to identify whether quantum systems can be replicated by standard computers. This framework defines classical simulability, the ability of a conventional computer to mimic a quantum system, as a problem of verifying certain mathematical conditions, offering a definitive method for distinguishing between quantum tasks genuinely suited to quantum computers and those achievable with existing technology. Mengyan Li of the University of Bristol and colleagues have developed a new method to determine whether quantum systems can be accurately mimicked by conventional computers.

This is vital because not all quantum computations offer a genuine advantage, as some can be replicated using classical algorithms, negating the need for specialised quantum hardware. The team’s approach defines ‘classical simulability’, the ability of a standard computer to reproduce a quantum system, as a mathematical problem of verifying specific conditions. A key concept is the ‘mutually unbiased basis’, which can be understood as asking a question in multiple ways to gain a complete picture, and this, alongside ‘positive-operator-valued measures’, akin to different filters analysing light, forms the basis of their tests. The researchers use a ‘semidefinite-programming hierarchy’, a set of mathematical tests, like progressively more detailed checklists, used to verify a property.

Definitive identification of classically simulable quantum states via semidefinite programming

The accuracy of determining classical simulability in quantum systems has improved, reaching a key classical visibility threshold of 0.83 for symmetric qubit families, a substantial increase over prior numerical searches. This breakthrough originates from a comprehensive semidefinite-programming (SDP) hierarchy, a series of mathematical tests that definitively characterises classically simulable state families in any finite dimension. Previously, identifying such families depended on incomplete methods incapable of guaranteeing a conclusive result. The significance of this lies in the fundamental task of quantum resource theory and quantum information processing, where determining whether a state family admits an irreducible quantum advantage is paramount. Classical simulability implies the absence of such an advantage, directing resources towards genuinely quantum-enhanced algorithms.

The new framework reformulates the problem as a feasibility test, linking state family behaviour to simpler rank-one projective measurements via deterministic response functions and positive-operator-valued measures. A classical visibility threshold of 0.83 is now reliably achievable when applying the SDP hierarchy to symmetric qubit families. It provides tests to confirm simulability and methods to prove when it fails, though current calculations are limited to relatively small systems. The SDP hierarchy operates by expressing the conditions for classical simulability as a set of linear inequalities. These inequalities, when satisfied, guarantee that the quantum states can be reproduced by a classical algorithm. The use of semidefinite programming allows for a rigorous and systematic verification of these conditions, unlike previous approaches that relied on approximations or heuristics. The deterministic response functions describe the probability of obtaining a specific outcome when measuring the quantum state, while the positive-operator-valued measures represent the different measurement operators used to extract information. These elements are crucial in establishing the connection between the quantum system and its classical counterpart.

The concept of ‘classical visibility’ is central to this work. It quantifies the extent to which a quantum state can be distinguished from a classical mixture. A visibility of 1.0 indicates perfect distinguishability, while a visibility of 0.0 implies that the state is indistinguishable from a classical mixture. The achieved threshold of 0.83 represents a significant improvement in the ability to detect classical simulability, allowing for a more accurate assessment of the potential for quantum advantage. This is particularly important in the context of quantum cryptography and quantum key distribution, where the security of the protocol relies on the indistinguishability of quantum states. The ability to reliably determine classical simulability is therefore crucial for ensuring the security of these protocols.

Computational cost restricts scalability to complex quantum systems

Although offering a systematic approach to verifying classical simulability, the practical application of this semidefinite-programming hierarchy encounters computational hurdles. Convex optimisation, upon which the method currently relies to establish feasibility, can become exceptionally demanding as quantum system size increases. This limitation is particularly noticeable with realistic quantum states, often exhibiting complex correlations beyond the scope of the tested symmetric examples and depolarizing noise models. A systematic method for distinguishing between quantum systems genuinely requiring quantum computers and those replicable by conventional means is now available. By reframing classical simulability as a mathematical feasibility problem, scientists can assess replicability using deterministic response functions and positive-operator-valued measures, or POVMs. The developed hierarchy offers a way to pinpoint the limits of classical simulation, but extending its application to larger, more complex systems remains a key area for future work.

The computational complexity stems from the fact that semidefinite programming involves solving a large system of linear inequalities, with the number of variables growing exponentially with the size of the quantum system. This makes it challenging to apply the method to systems with more than a few qubits. Furthermore, the SDP hierarchy requires the solution of a series of increasingly complex optimisation problems, adding to the computational burden. Researchers are actively exploring techniques to mitigate these computational challenges, such as developing more efficient algorithms for solving semidefinite programs and exploiting the structure of the problem to reduce the number of variables. Approximations and heuristics may also be necessary to tackle larger systems, although these come at the cost of reduced accuracy.

Future research will focus on extending this approach to more complex scenarios, tackling the significant challenge of scaling to realistically complex quantum systems. This includes investigating the applicability of the SDP hierarchy to different types of quantum states, such as those generated by noisy quantum circuits, and developing methods for handling systems with many qubits. The development of more efficient algorithms and the exploitation of parallel computing resources will also be crucial for overcoming the computational limitations. Ultimately, the goal is to provide a practical tool for assessing the potential for quantum advantage in a wide range of applications, paving the way for the development of truly quantum-enhanced technologies.

Researchers developed a complete framework using semidefinite programming to determine whether a family of quantum states can be efficiently simulated by a classical computer. This is important because identifying the limits of classical simulation helps define where a quantum computer might genuinely offer an advantage. The method characterises classical simulability through feasibility tests and affine witnesses, and was applied to state families mixed with depolarizing noise to establish computable bounds. Future work intends to extend this approach to more complex quantum systems and address the computational challenges associated with larger simulations.