Gabriel Waite and Karl Lin Sydney demonstrate that the Succinct State 2-Local Hamiltonian problem for qubits is (promise) MA-complete, establishing a fundamental limit to how easily these quantum states can be verified. Their work combines a characterisation of succinct quantum states with a refined reduction that lowers the locality of Feynman-Kitaev circuit-Hamiltonians from 6 to 2, without increasing particle dimension.
This reveals a “complexity phase transition, parameterised by locality,” extending known instances of MA-complete problems and clarifying how succinctness behaves in quantum systems. The researchers are working toward a better understanding of the boundary between efficiently describable and efficiently verifiable quantum systems.
Succinct States Defined Through Number Field Arithmetic
Arithmetic over specific number fields provides a systematic way to characterize succinct quantum states, refining the understanding of how these states are computationally described. This reduction in locality is achieved through a characterization of succinct states defined by arithmetic, allowing for a more compact representation of quantum information. Researchers are also investigating fundamental questions about the nature of succinct states. A key consideration is the classical query algorithm for subset states, which relies on a membership oracle, only providing useful information when the coefficient associated with a subset is equal to one.
Subset States and Hybrid Operations
The characterization of subset states extends to operations involving hybrid constructions, specifically through the definition of hybrid subset states and classically encoded hybrid subset states. A hybrid subset state is defined for any subset S and a set of consecutive integers I, providing a framework for representing states with encoded information. These states use orthogonal subsets to allow for bookkeeping and manipulation of amplitudes within the quantum system.
This allows for the systematic exploration of how succinctness is maintained or altered through circuit-based operations. The team’s analysis focuses on the exact representations of state amplitudes, aiming to define succinct states arising from specific gate sets acting on subset states.
Succinct State Local Hamiltonian Problem Formulation
This classification holds even when restricting the Hamiltonian to interactions involving only two qubits, a significant refinement in problem constraints. Previous work demonstrated MA-completeness for the Succinct State Local Hamiltonian problem generally, but this result confirms that reduced locality does not diminish the computational challenge. The results further clarify how succinctness behaves under circuit-based constructions. This investigation diverges from the standard Local Hamiltonian problem, which is QMA-complete, by focusing on scenarios where the ground state itself is succinctly describable rather than merely approximated.
The team’s results demonstrate that this altered representation exposes an important question. How much classical structure within a ground state is sufficient to enable a transition from quantum to classical verification methods? A diagram included in the work illustrates the complexity of the Succinct State Local Hamiltonian problem, showing how modifications and reductions influence its classification, with solid arrows indicating the flow of ideas akin to a reduction.
MA-Completeness for 6-Local Hamiltonians Established
The work builds on a structured circuit decomposition approach, refining how these quantum systems are modeled and analyzed. This reduction uses circuits with gates occurring at fixed, regular intervals, a necessary condition for applying a specific construction technique detailed in prior research. The study’s exploration of succinct states extends to how combining different states impacts computational complexity, revealing that a k-local Hamiltonian on n-qubits with a classically succinct ground state can be transformed into a *(k+1)*-local Hamiltonian on *(n+1)*-qubits while maintaining succinctness.
Reducing the complexity of quantum Hamiltonians relies on structured circuit decomposition, and recent work demonstrates a pathway to achieving 2-local Hamiltonians from circuits initially possessing a higher locality. This regularity, achieved through careful circuit manipulation, is central to lowering the computational demands of verifying quantum states.
Decomposition to Structured Clifford+T Circuits
The ability to reduce locality to three, a key step in simplifying quantum Hamiltonians, now benefits from two distinct approaches detailed in recent work. One method adapts the clock construction originally proposed by Kempe and Regev, incorporating penalties for invalid clock states and isolating two clock qubits to prevent interference with propagation terms. A second, complementary technique decomposes reversible circuits into a structured Clifford+T format, extending the difficulty of verifying succinct states to a broader range of Hamiltonians.
This decomposition into structured circuits relies on building from Toffoli-equivalent circuits that adhere to strict structural constraints, defining a new promise class termed StMAq. This regularity is not merely an aesthetic choice; it directly addresses the computational demands of succinct quantum states by streamlining the circuit structure. “Using the same clock construction as in the proof Section I.1.2 and leveraging the solution of Section I.1.1, we have the following result,” the researchers state, highlighting the interconnectedness of their methods.
Local Hamiltonian Complexity and Phase Transition
Lowering the locality of Feynman-Kitaev circuit-Hamiltonians from six to two, without expanding the number of qubits required, represents a significant refinement in modeling these quantum systems. The team’s approach bypasses the use of perturbative gadgets, which can compromise the succinctness of ground states, and instead relies on direct clock-based reductions coupled with careful gate decompositions.
Liu previously showed the Real Succinct State 6-Local Stoquastic Hamiltonian problem is also MA-complete, using an analysis of eStoqMA and easy witnesses, uniform superposition states with efficient verification. The new results demonstrate a sharp boundary in the problem’s complexity phase diagram, as the 1-local case is solvable in NC (Nick’s Class), while complexity increases with locality. The diagram highlights the team’s progression towards a 3-local and then 2-local MA-complete problem, demonstrating a clear trend in computational difficulty.
Feynman-Kitaev Circuit-Hamiltonians and Succinctness
The team’s method instead uses direct clock-based reductions coupled with gate decompositions that preserve succinctness throughout the process. Confirming the ground state of the Feynman-Kitaev clock Hamiltonian as a succinct state required careful attention to normalisation and amplitude representation. The researchers ensured the history state, central to their proof, could be expressed using a polynomial number of bits, aligning with their definition of succinctness. Alternative normalisation methods, such as padding with identity gates, were considered but rejected in favour of broader applicability through algebraic encodings.
This focus on maintaining succinctness is important, as standard perturbative techniques often fail to preserve the concise structure of the quantum states being simulated. The history state associated with the Feynman-Kitaev clock construction is a succinct state on a specific subset, where the number of required bits to define the state scales logarithmically with the circuit size.
Maintaining Succinctness During Gate Decomposition
proved critical to refining computational approaches, as the team achieved a reduction in locality from six to two within Feynman-Kitaev circuit-Hamiltonians without increasing the dimensionality of the system. This decomposition relies on constructing circuits where each gate appears at a fixed, regular interval, a necessary condition for applying the 2-local clock Hamiltonian construction detailed in prior work. The resulting regularity allows for a more efficient representation of quantum states and facilitates verification protocols.
The robustness of existing verification methods extends to algebraically encoded succinct states, a finding stemming from the structure of the history state and the decomposition circuits employed. Researchers demonstrated polynomial-time classical algorithms for expressing amplitudes, sufficient for the verification steps of the protocol, and this characterisation of succinct states supports the claim that the existing MA protocol remains valid even with the inclusion of -succinct states. The researchers state, highlighting the connection between algebraic structure and efficient verification.
See today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals.
