arXiv subjects

Gilad Kishony

Publications and source records attributed to Gilad Kishony.

12 recordsLinked to original sources

arXiv2026

Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams

Pipe diagrams have emerged as a powerful framework for flexible lattice surgery compilation and spacetime optimization for the surface code. In contrast, analogous compilation techniques for color code architectures remain largely unexplored, despite the color code's favorable properties, including reduced qubit overhead and transversal single-qubit Clifford gates. In this work, we develop a pipe diagram representation for the triangular color code on the 6.6.6 lattice and establish its correspondence to ZX-diagrammatic descriptions of computation. We present distance-independent constructions of color code pipe diagrams together with explicit realizations of correlation surfaces, stabilizers, and syndrome extraction circuits. This framework enables both macroscopic optimization of logical computations in spacetime and microscopic compilation to executable syndrome extraction circuits. We demonstrate the potential for compact spacetime embeddings with the color code's geometry. These results provide a foundation for automated lattice surgery compilation and diagrammatic optimization in color code architectures.

quant-ph↗

arXiv2026

Low-cost quantum error mitigation via auxiliary qubit return validation

We introduce a low-overhead technique for quantum error mitigation based on post-selection using auxiliary qubit measurements. The method exploits the structural property that, in an error-free computation, auxiliary qubits are often expected to return to the zero state after use. By selectively measuring these qubits at carefully chosen points in the circuit, erroneous shots can be identified and discarded, improving result fidelity with minimal hardware overhead. To account for circuit noise, including measurement errors, we analyze the likelihood that a measurement outcome indicates a corrupted shot. This analysis is informed by the measurement's backward light cone, namely the set of circuit operations that could affect the outcome. Shots whose auxiliary measurement outcomes imply a corruption likelihood above a tunable threshold are rejected. Simulations show that the method reduces the false-negative rate by approximately 10% while discarding only approximately 1% of valid shots. The threshold controls the bias-variance tradeoff inherent to post-selection, allowing the method to be adapted to the fidelity and sampling requirements of different applications.

quant-ph↗

arXiv2026

Optimal Approximation of Single Qubit Rotations within a Quantum Circuit

Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli rotations, yielding an approximating sequence with $T$-count that equals $3 \log_2(1/ε)$ for a target precision $ε$. Magnitude Approximation can reduce the $T$-count to only $1 \log_2(1/ε)$ by allowing large residual errors, which are rotations about orthogonal axes. Within a complete quantum circuit, these residual errors can then be absorbed into neighboring gates before they are approximated themselves. Determining the optimal allocation of approximation strategies within a large, multi-qubit circuit presents a significant combinatorial challenge. In this work, we present a linear-time algorithm that guarantees an optimal solution to this problem. We demonstrate that the issue of delegating Magnitude versus Diagonal approximation across a circuit maps formally to a classical 1D Ising model with a spatially varying field. By minimizing the energy of this Hamiltonian, we identify the optimal approximation configuration for each rotation without exponential overhead. Benchmarking our method against standard diagonal approximation on random quantum circuits, we observe an average reduction of 26\% in the total approximating circuit gate count, offering a significant efficiency gain for the implementation of quantum algorithms on near-term and fault-tolerant architectures.

quant-ph↗

arXiv2026

Color code off-the-hook: avoiding hook errors with a single auxiliary per plaquette

Syndrome extraction in the planar color code is complicated by high weight stabilizers and hook errors that can reduce the circuit-level distance. With a single auxiliary qubit per plaquette, any spatially uniform circuit halves the circuit-level distance. We propose a single-auxiliary syndrome extraction circuit with color-dependent gate schedules that avoids all malign hook errors in the bulk, thereby preserving the full circuit-level distance. The circuit has minimal depth: all stabilizers of the same Pauli type are measured in parallel in six time steps. Furthermore, this schedule can be readily applied to the XYZ color code circuit, yielding an improved temporal distance. We find that at the boundary, no single hook error alone reduces the distance; instead, only certain combinations of hook errors do, which we call fractional hook errors. We demonstrate through Monte Carlo simulations over a range of circuit-level noise models and physical error rates that our circuit outperforms the previous state of the art.

quant-ph↗

arXiv2026

Surface code off-the-hook: diagonal syndrome-extraction scheduling

In the rotated surface code, hook errors (errors on auxiliary qubits midway through syndrome extraction that propagate to correlated two-qubit data errors) can reduce the circuit-level code distance by a factor of two if the extraction schedule is poorly chosen. The traditional approach uses N-shaped and Z-shaped schedules, selecting the orientation in each plaquette to avoid hook errors aligned with logical operators. However, this becomes increasingly complex within lattice surgery primitives with varied boundary geometries, and requires a 7-step schedule to avoid gate collisions. We propose the diagonal schedule, which orients hook errors along the diagonal of each plaquette. These diagonal errors crucially never align with logical operators regardless of boundary orientation, achieving full code distance. The diagonal schedule is globally uniform: all X-type plaquettes use one schedule and all Z-type plaquettes use another, eliminating geometry-dependent planning. On hardware supporting parallel measurement, reset, and gate operations, the schedule achieves a minimal period of 6 time steps, compared to 7 for the traditional approach. We demonstrate effectiveness for memory experiments, spatial junctions, spatial Hadamard gates, and patch rotation, showing equivalent or improved logical error rates while simplifying circuit construction.

quant-ph↗

arXiv2026

Increasing the distance of topological codes with time vortex defects

We propose modifying topological quantum error correcting codes by incorporating space-time defects, termed ``time vortices,'' to reduce the number of physical qubits required to achieve a desired logical error rate. A time vortex is inserted by adding a spatially varying delay to the periodic measurement sequence defining the code such that the delay accumulated on a homologically non-trivial cycle is an integer multiple of the period. We analyze this construction within the framework of the Floquet color code and optimize the embedding of the code on a torus along with the choice of the number of time vortices inserted in each direction. Asymptotically, the vortexed code requires less than half the number of qubits as the vortex-free code to reach a given code distance. We benchmark the performance of the vortexed Floquet color code by Monte Carlo simulations with a circuit-level noise model and demonstrate that the smallest vortexed code (with $30$ qubits) outperforms the vortex-free code with $42$ qubits.

quant-ph↗

arXiv2025

Vari-Cool: a non-unitary quantum variational protocol for simulated cooling

We introduce a variational approach for preparing low energy states of arbitrary target Hamiltonians. The protocol is defined in terms of a repeated cycle consisting of p layers of unitary gates applied to the system and ancilla "bath" qubits, followed by reset of the bath qubits. The gate parameters within each cycle are optimized such that the steady state achieved after many cycles has a low energy expectation value with respect to the target Hamiltonian, and that the energy converges toward the steady state value in as few cycles as possible. We illustrate the protocol for the transverse field Ising model, and study its systematic behaviors with respect to system size, model parameters, and noise using tensor network based classical simulations. We then experimentally demonstrate its operation on IBM's ibm_kingston quantum processor for up to 28 system qubits coupled to 14 bath sites. Classical training on small system sizes and with few unitary layers per cycle gives robust results that transfer well to larger system sizes and to noisy hardware.

quant-ph↗

arXiv2025

Topological excitations at time vortices in periodically driven systems

We consider two-dimensional periodically driven systems of fermions with particle-hole symmetry. Such systems support non-trivial topological phases, including ones that cannot be realized in equilibrium. We show that a space-time defect in the driving Hamiltonian, dubbed a ``time vortex,'' can bind $π$ Majorana modes. A time vortex is a point in space around which the phase lag of the Hamiltonian changes by a multiple of $2π$. We demonstrate this behavior on a periodically driven version of Kitaev's honeycomb spin model, where $\mathbb{Z}_2$ fluxes and time vortices can realize any combination of $0$ and $π$ Majorana modes. We show that a time vortex can be created using Clifford gates, simplifying its realization in near-term quantum simulators.

cond-mat.str-el↗

arXiv2025

Efficiently preparing chiral states via fermionic cooling on bosonic quantum hardware

Simulating many-body systems is one of the most promising applications of near-term quantum computers. An important open question is how to efficiently prepare the ground states of arbitrary fermionic Hamiltonians, especially those with nontrivial topology. Here, we propose an efficient protocol for preparing low-energy states of fermionic Hamiltonians on a noisy bosonic quantum simulator by adiabatic cooling using a simulated bath. We arrange the couplings such that the simulated system and bath together obtain a local fermionic description in which fermionic excitations can be extracted individually, via coherent hopping to the bath, rather than in pairs as would otherwise be required by fermion parity conservation. This approach thus achieves a linear (rather than quadratic) scaling of the cooling rate vs. excitation density at low densities. We show that certain topological phases such as the chiral (non-Abelian) phase of the Kitaev honeycomb model can be prepared efficiently using our protocol. Our protocol performs favorably in the presence of noise, making it suitable for execution on near-term quantum devices.

cond-mat.str-el↗

arXiv2025

Gauged cooling of topological excitations and emergent fermions on quantum simulators

Simulated cooling is a robust method for preparing low-energy states of many-body Hamiltonians on near-term quantum simulators. In such schemes, a subset of the simulator's spins (or qubits) are treated as a ``bath,'' which extracts energy and entropy from the system of interest. However, such protocols are inefficient when applied to systems whose excitations are highly non-local in terms of the microscopic degrees of freedom, such as topological phases of matter; such excitations are difficult to extract by a local coupling to a bath. We explore a route to overcome this obstacle by encoding of the microscopic degrees of freedom into those of the quantum simulator in a non-local manner. To illustrate the approach, we show how to efficiently cool the ferromagnetic phase of the quantum Ising model, whose excitations are domain walls, via a ``gauged cooling'' protocol in which the Ising spins are coupled to a $Z_2$ gauge field that simultaneously acts as a reservoir for removing excitations. We show that our protocol can prepare the ground states of the ferromagnetic and paramagnetic phases equally efficiently. The gauged cooling protocol naturally extends to (interacting) fermionic systems, where it is equivalent to cooling by coupling to a fermionic bath via single-fermion hopping.

cond-mat.str-el↗

arXiv2025

Design and synthesis of scalable quantum programs

We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program. Advanced synthesis algorithms transform the model into a low-level quantum program that meets the user's specification and is directed at a stipulated hardware. This separation of description from implementation is essential for scale. The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space. The results show clear superiority over the compilation and transpilation methods used today. We expect that this technological approach will take over and prevail as quantum software become more demanding, complex, and essential.

quant-ph↗

arXiv2021

Converting electrons into emergent fermions at a superconductor-Kitaev spin liquid interface

We study an interface between a Kitaev spin liquid (KSL) in the chiral phase and a non-chiral superconductor. When the coupling across the interface is sufficiently strong, the interface undergoes a transition into a phase characterized by a condensation of a bound state of a Bogoliubov quasiparticle in the superconductor and an emergent fermionic excitation in the spin liquid. In the condensed phase, electrons in the superconductor can coherently convert into emergent fermions in the spin liquid and vice versa. As a result, the chiral Majorana edge mode of the spin liquid becomes visible in the electronic local density of states at the interface, which can be measured in scanning tunneling spectroscopy experiments. We demonstrate the existence of this phase transition, and the non-local order parameter that characterizes it, using density matrix renormalization group simulations of a KSL strip coupled at its edge to a superconductor. An analogous phase transition can occur in a simpler system composed of a one-dimensional spin chain with a spin-flip $\mathbb{Z}_2$ symmetry coupled to a superconductor.

cond-mat.str-el↗