Certifying Hamiltonians while automating planar layouts (10/07/26)

TL;DR An open-source flow, mqt-scpd (Munich Quantum Toolkit superconducting physical design), turns planar cQED chip layout—qubits, couplers, and control lines under real fabrication design rules—into a fully automatic geometric pipeline that emits manufacturing-ready floorplans in seconds to minutes. That closes the gap between hand layout (days to weeks) and prior automation that dropped physical constraints and never reached fab-ready GDS.

• Problem: Planar superconducting quantum chip (SCQC) layout is still mostly manual; prior automation tools simplify the geometry or relax design-rule constraints and therefore do not deliver fabrication-ready results.
• Abstraction: The authors map device physics—pad clearances, routing channels, and port placement on qubit/coupler cells—into a rigorous geometric formulation so CAD methods can enforce the same rules hardware engineers already check by hand.
• Flow: A three-stage pipeline runs geometry-aware global partitioning (cavity-tree splits around routing bottlenecks), ILP-based port assignment (integer linear programming that chooses which pad each net lands on), then hierarchical routing with conflict resolution.
• Result: Interdisciplinary checks by design-automation and superconducting-hardware experts confirm complete, design-rule-compliant layouts at the push of a button, up to about $25\times$ faster than prior automated baselines on hard instances.
• Release: Methods ship as open-source mqt-scpd inside the Munich Quantum Toolkit—the first end-to-end planar SCQC physical-design flow that keeps the underlying physical constraints explicit.

TL;DR A quantum Kikuchi matrix—a spectral certificate assembled from overlapping Pauli products, in the spirit of classical $k$-XOR CSP refutation—yields efficiently checkable lower bounds that, for typical random signed $k$-local Pauli Hamiltonians, track the true ground energy to additive error $\epsilon$. The same method fails in the worst case: non-commutative Sum-of-Squares (ncSoS), the Sum-of-Squares hierarchy augmented by Pauli commutation relations, leaves a constant gap even at $\Omega (n)$ levels on a modified NLTS (no low-energy trivial states) family that is also NP-hard to approximate and requires $\Omega (\log n)$ circuit depth for all low-energy states.

• Main result: For any constant $\ell$, an efficiently computable length-$n^{O(\ell )}$ spectral certificate is always a valid lower bound on the ground energy of a random $n$-qubit signed $k$-local Pauli Hamiltonian, and with high probability is $\epsilon$-accurate once the Hamiltonian has enough terms.
• Method: The certificate comes from a quantum Kikuchi matrix that lifts classical $k$-XOR CSP refutation to $k$-local Pauli Hamiltonians and bounds the ground energy via the matrix's spectral norm.
• Limitation: By construction, the same spectral technique can fail to produce tight certificates on worst-case signed $k$-local Pauli instances.
• Hardness stack: A modification of prior quantum-code NLTS Hamiltonians simultaneously yields $\Omega (\log n)$-depth lower bounds for all low-energy states, constant-gap NP-hardness of approximating the ground energy, and a constant-gap ncSoS integrality gap through $\Omega (n)$ levels.
• Conceptual frame: ncSoS is the standard Sum-of-Squares hierarchy augmented by the commutation relations among Pauli operators, which is what makes the worst-case lower bounds nontrivial.

TL;DR HRL and Microsoft benchmark exchange-only control—gates driven only by voltage-tuned two-spin exchange—across up to 48 electron spins by treating the full total-spin-zero ($S=0$) singlet manifold (Hilbert-space dimension $>2^{40}$) as the computational workspace rather than discarding most states as leakage. Out-of-time-order correlators (OTOCs; probes of operator scrambling under forward–backward evolution) show rich scrambling, while generalized cross-entropy and mirror randomized benchmarking yield an effective system-level error of $3\times 10^{-4}$ per exchange, up to an order of magnitude below comparable platform-level figures at the time of writing.

• Main idea: Instead of encoding logical qubits in three-spin decoherence-free subsystems and treating the rest of the spin space as leakage, the experiment benchmarks the entire exchange-only array inside the total-spin-zero singlet manifold.
• Scale: Arrays of up to 48 electron spins access an $S=0$ Hilbert space with dimension exceeding $2^{40}$, far larger than the $2^{N/3}$ subspace of conventional three-spin encodings for $N$ spins.
• Scrambling: OTOC measurements expose rich operator-spreading dynamics and reach regimes argued to be relevant to quantum computational advantage.
• Error metric: Generalized cross-entropy benchmarking (XEB; comparing measured bitstring probabilities to ideal circuit predictions) and mirror randomized benchmarking (MRB; random circuits followed by their inverses) give an aggregate error of $3\times 10^{-4}$ per two-spin exchange, folding in the full control sequence and all noise sources.
• Comparison: That per-exchange system error is reported as up to about $10\times$ lower than contemporaneous comparable benchmarks on other hardware platforms.