SearcharxivSearch

arXiv subjects

Ryan V. Mishmash

Publications and source records attributed to Ryan V. Mishmash.

At least 19 recordsLinked to original sources

Distinct Lifetimes for $X$ and $Z$ Loop Measurements in a Majorana Tetron Device

We present a hardware realization and measurements of a tetron qubit device in a superconductor-semiconductor heterostructure. The device architecture contains two parallel superconducting nanowires, which support four Majorana zero modes (MZMs) when tuned into the topological phase, and a trivial superconducting backbone. Two distinct readout interferometers are formed by connecting the superconducting structure to a series of quantum dots. We perform single-shot interferometric measurements of the fermion parity for the two loops, designed to implement Pauli-$X$ and $Z$ measurements of the tetron. Performing repeated single-shot measurements yields two widely separated time scales $τ_X = 14.5\pm 0.3 \, \mathrm{μs}$ and $τ_Z = 12.4\pm 0.4\, \mathrm{ms}$ for parity switches observed in the $X$ and $Z$ measurement loops, which we attribute to intra-wire parity switches and external quasiparticle poisoning, respectively. We estimate assignment errors of $\mathrm{err}^X_a=16\%$ and $\mathrm{err}^Z_a=0.5\%$ for $X$ and $Z$ measurement-based operations, respectively.

cond-mat.mes-hall

Excising dead components in the surface code using minimally invasive alterations: A performance study

The physical implementation of a large-scale error-corrected quantum processor will necessarily need to mitigate the presence of defective (thereby "dead") physical components in its operation, for example, identified during bring-up of the device or detected in the middle of a computation. In the context of solid-state qubits, the quantum error correcting protocol operating in the presence of dead components should ideally (i) use the same native operation set as that without dead components, (ii) maximize salvaging of functional components, and (iii) use a consistent global operating schedule which optimizes logical qubit performance and is compatible with the control requirements of the system. The scheme proposed by Grans-Samuelsson et al. [Quantum 8, 1429 (2024)] satisfies all three of these criteria: it effectively excises (cuts out) dead components from the surface code using minimally invasive alterations (MIA). We conduct extensive numerical simulations of this proposal for the pairwise-measurement-based surface code protocol in the presence of dead components under circuit-level noise. To that end, we also describe techniques to automatically construct performant check (detector) bases directly from circuits without manual circuit annotation, which may be of independent interest. Both the MIA scheme and this automated check basis computation can be readily used with measurement-based as well as CNOT-based circuits, and the results presented here demonstrate state-of-the-art performance.

quant-ph

Fault-tolerant quantum computation with a neutral atom processor

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, which can be detected by imaging. Full connectivity is enabled by atom movement. We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates. In both cases, "erasure conversion," changing errors into a form that can be detected independently from qubit state, improves circuit performance. These results begin to clear a path for achieving scientific quantum advantage with a programmable neutral atom quantum processor.

quant-ph

Response to recent comments on Phys. Rev. B 107, 245423 (2023) and Subsection S4.3 of the Supp. Info. for Nature 638, 651-655 (2025)

The topological gap protocol (TGP) is a statistical test designed to identify a topological phase with high confidence and without human bias. It is used to determine a promising parameter regime for operating topological qubits. The protocol's key metric is the probability of incorrectly identifying a trivial region as topological, referred to as the false discovery rate (FDR). Two recent manuscripts [arXiv:2502.19560, arXiv:2503.08944] engage with the topological gap protocol and its use in Phys. Rev. B 107, 245423 (2023) and Subsection S4.3 of the Supplementary Information for Nature 638, 651-655 (2025), although they do not explicitly dispute the main results of either one. We demonstrate that the objections in arXiv:2502.19560 and arXiv:2503.08944 are unfounded, and we uphold the conclusions of Phys. Rev. B 107, 245423 (2023) and Nature 638, 651-655 (2025). Specifically, we show that no flaws have been identified in our estimate of the false discovery rate (FDR). We provide a point-by-point rebuttal of the comments in arXiv:2502.19560 and arXiv:2503.08944.

cond-mat.mes-hall

Predictive simulations of the dynamical response of mesoscopic devices

As the complexity of mesoscopic quantum devices increases, simulations are becoming an invaluable tool for understanding their behavior. This is especially true for the superconductor-semiconductor heterostructures used to build Majorana-based topological qubits, where quantitatively understanding the interplay of topological superconductivity, disorder, semiconductor quantum dots, Coulomb blockade and noise has been essential for progress on device design and interpretation of measurements. In this paper, we describe a general framework to simulate the low-energy quantum dynamics of such complex systems. We illustrate our approach by computing the dispersive gate sensing (DGS) response of quantum dots coupled to topological superconductors. We start by formulating the DGS response as an open-system quantum dynamics problem, which allows a consistent treatment of drive backaction as well as quantum and classical noise. For microscopic quantum problems subject to Coulomb-blockade, where a direct solution in the exponentially large many-body Hilbert space would be prohibitive, we introduce a series of controlled approximations that incorporate ideas from tensor network theory and quantum chemistry to reduce this Hilbert space to a few low-energy degrees of freedom that accurately capture the low-energy quantum dynamics. We demonstrate the methods introduced in this paper on the example of a single quantum dot coupled to a topological superconductor and a microscopic realization of the fermion parity readout setup of Aghaee et al. arXiv:2401.09549 (2024).

cond-mat.mes-hall

Improved Pairwise Measurement-Based Surface Code

We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements and three auxiliary qubits per plaquette. This realization gains substantial advantages over prior pairwise measurement-based realizations of the surface code. It has a short operation period of 4 steps and our performance analysis for a standard circuit noise model yields a high fault-tolerance threshold of approximately $0.66\% $. The syndrome extraction circuits avoid bidirectional hook errors, so we can achieve full code distance by choosing appropriate boundary conditions. We also construct variants of the syndrome extraction circuits that entirely prevent hook errors, at the cost of larger circuit depth. This achieves full distance regardless of boundary conditions, with only a modest decrease in the threshold. Furthermore, we propose an efficient strategy for dealing with dead components (qubits and measurements) in our surface code realization, which can be adopted more generally for other surface code realizations. This new surface code realization is highly optimized for Majorana-based hardware, accounting for constraints imposed by layouts and the implementation of measurements, making it competitive with the recently proposed Floquet codes.

quant-ph

Interferometric Single-Shot Parity Measurement in an InAs-Al Hybrid Device

The fusion of non-Abelian anyons or topological defects is a fundamental operation in measurement-only topological quantum computation. In topological superconductors, this operation amounts to a determination of the shared fermion parity of Majorana zero modes. As a step towards this, we implement a single-shot interferometric measurement of fermion parity in indium arsenide-aluminum heterostructures with a gate-defined nanowire. The interferometer is formed by tunnel-coupling the proximitized nanowire to quantum dots. The nanowire causes a state-dependent shift of these quantum dots' quantum capacitance of up to 1 fF. Our quantum capacitance measurements show flux h/2e-periodic bimodality with a signal-to-noise ratio of 1 in 3.7 $μ$s at optimal flux values. From the time traces of the quantum capacitance measurements, we extract a dwell time in the two associated states that is longer than 1 ms at in-plane magnetic fields of approximately 2 T. These results are consistent with a measurement of the fermion parity encoded in a pair of Majorana zero modes that are separated by approximately 3 $μ$m and subjected to a low rate of poisoning by non-equilibrium quasiparticles. The large capacitance shift and long poisoning time enable a parity measurement error probability of 1%.

cond-mat.mes-hall

Logical blocks for fault-tolerant topological quantum computation

Logical gates constitute the building blocks of fault-tolerant quantum computation. While quantum error-corrected memories have been extensively studied in the literature, explicit constructions and detailed analyses of thresholds and resource overheads of universal logical gate sets have so far been limited. In this paper, we present a comprehensive framework for universal fault-tolerant logic motivated by the combined need for platform-independent logical gate definitions, flexible and scalable tools for numerical analysis, and exploration of novel schemes for universal logic that improve resource overheads. Central to our framework is the description of logical gates holistically in a way which treats space and time on a similar footing. Focusing on schemes based on surface codes, we introduce explicit, but platform-independent representations of topological logic gates -- called logical blocks -- and generate new, overhead-efficient methods for universal quantum computation. As a specific example, we propose fault-tolerant schemes based on surface codes concatenated with more general low-density parity check (LDPC) codes. The logical blocks framework enables a convenient mapping from an abstract description of the logical gate to a precise set of physical instructions for both circuit-based and fusion-based quantum computation (FBQC). Using this, we numerically simulate a surface-code-based universal gate set implemented with FBQC, and verify that their thresholds are consistent with the bulk memory threshold. We find that boundaries, defects, and twists can significantly impact the logical error rate scaling, with periodic boundary conditions potentially halving the resource requirements. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme based on the teleportation of twists that may offer further resource reductions.

quant-ph

Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection

We introduce a variational quantum algorithm to solve unconstrained black box binary optimization problems, i.e., problems in which the objective function is given as black box. This is in contrast to the typical setting of quantum algorithms for optimization where a classical objective function is provided as a given Quadratic Unconstrained Binary Optimization problem and mapped to a sum of Pauli operators. Furthermore, we provide theoretical justification for our method based on convergence guarantees of quantum imaginary time evolution. To investigate the performance of our algorithm and its potential advantages, we tackle a challenging real-world optimization problem: feature selection. This refers to the problem of selecting a subset of relevant features to use for constructing a predictive model such as fraud detection. Optimal feature selection -- when formulated in terms of a generic loss function -- offers little structure on which to build classical heuristics, thus resulting primarily in 'greedy methods'. This leaves room for (near-term) quantum algorithms to be competitive to classical state-of-the-art approaches. We apply our quantum-optimization-based feature selection algorithm, termed VarQFS, to build a predictive model for a credit risk data set with 20 and 59 input features (qubits) and train the model using quantum hardware and tensor-network-based numerical simulations, respectively. We show that the quantum method produces competitive and in certain aspects even better performance compared to traditional feature selection techniques used in today's industry.

quant-ph

Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions

The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress in the field. So far, tools from theoretical quantum information have been not thoroughly explored for this task. Here we take a step in this direction by presenting efficiently computable Clifford similarity transformations for quantum chemistry Hamiltonians, which expose bases with reduced entanglement in the corresponding molecular ground states. These transformations are constructed via block diagonalization of a hierarchy of truncated molecular Hamiltonians, preserving the full spectrum of the original problem. We show that the bases introduced here allow for more efficient classical and quantum computation of ground state properties. First, we find a systematic reduction of bipartite entanglement in molecular ground states as compared to standard problem representations. This entanglement reduction has implications in classical numerical methods such as ones based on the density matrix renormalization group. Then, we develop variational quantum algorithms that exploit the structure in the new bases, showing again improved results when the hierarchical Clifford transformations are used.

quant-ph

Quantum-enhanced Markov chain Monte Carlo

Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from complicated distributions that are hard to sample from classically, but which seldom arise in applications. Here we introduce a quantum algorithm to sample from distributions that pose a bottleneck in several applications, which we implement on a superconducting quantum processor. The algorithm performs Markov chain Monte Carlo (MCMC), a popular iterative sampling technique, to sample from the Boltzmann distribution of classical Ising models. In each step, the quantum processor explores the model in superposition to propose a random move, which is then accepted or rejected by a classical computer and returned to the quantum processor, ensuring convergence to the desired Boltzmann distribution. We find that this quantum algorithm converges in fewer iterations than common classical MCMC alternatives on relevant problem instances, both in simulations and experiments. It therefore opens a new path for quantum computers to solve useful--not merely difficult--problems in the near term.

quant-ph

Efficient matrix-product-state preparation of highly entangled trial states: Weak Mott insulators on the triangular lattice revisited

Using tensor network states to unravel the physics of quantum spin liquids in minimal, yet generic microscopic spin or electronic models remains notoriously challenging. A prominent open question concerns the nature of the insulating ground state of two-dimensional half-filled Hubbard-type models on the triangular lattice in the vicinity of the Mott metal-insulator transition, a regime which can be approximated microscopically by a spin-1/2 Heisenberg model supplemented with additional "ring-exchange" interactions. Using a novel and efficient state preparation technique whereby we initialize full density matrix renormalization group (DMRG) calculations with highly entangled Gutzwiller-projected Fermi surface trial wave functions, we show -- contrary to previous works -- that the simplest triangular lattice $J$-$K$ spin model with four-site ring exchange likely does not harbor a fully gapless U(1) spinon Fermi surface (spin Bose metal) phase on four- and six-leg wide ladders. Our methodology paves the way to fully resolve with DMRG other controversial problems in the fields of frustrated quantum magnetism and strongly correlated electrons.

cond-mat.str-el

Dephasing and leakage dynamics of noisy Majorana-based qubits: Topological versus Andreev

Topological quantum computation encodes quantum information nonlocally by nucleating non-Abelian anyons separated by distances $L$, typically spanning the qubit device size. This nonlocality renders topological qubits exponentially immune to dephasing from all sources of classical noise with operator support local on the scale of $L$. We perform detailed analytical and numerical analyses of a time-domain Ramsey-type protocol for noisy Majorana-based qubits that is designed to validate this coveted topological protection in near-term devices such as the so-called `tetron' design. By assessing dependence of dephasing times on tunable parameters, e.g., magnetic field, our proposed protocol can clearly distinguish a bona fide Majorana qubit from one constructed from semilocal Andreev bound states, which can otherwise closely mimic the true topological scenario in local probes. In addition, we analyze leakage of the qubit out of its low-energy manifold due to classical-noise-induced generation of quasiparticle excitations; leakage limits the qubit lifetime when the bulk gap collapses, and hence our protocol further reveals the onset of a topological phase transition. This experiment requires measurement of two nearby Majorana modes for both initialization and readout---achievable, for example, by tunnel coupling to a nearby quantum dot---but no further Majorana manipulations, and thus constitutes an enticing pre-braiding experiment. Along the way, we address conceptual subtleties encountered when discussing dephasing and leakage in the context of Majorana qubits.

cond-mat.mes-hall

Majorana lattices from the quantized Hall limit of a proximitized spin-orbit coupled electron gas

Motivated by recent experiments demonstrating intricate quantum Hall physics on the surface of elemental bismuth, we consider proximity coupling an $s$-wave superconductor to a two-dimensional electron gas with strong Rashba spin-orbit interactions in the presence of a strong perpendicular magnetic field. We focus on the high-field limit so that the superconductivity can be treated as a perturbation to the low-lying Landau levels. In the clean case, wherein the superconducting order parameter takes the form of an Abrikosov vortex lattice, we show that a lattice of hybridized Majorana modes emerges near the plateau transition of the lowest Landau level. However, unless magnetic-symmetry-violating perturbations are present, the system always has an even number of chiral Majorana edge modes and thus is strictly speaking Abelian in nature, in agreement with previous work on related setups. Interestingly, however, a weak topological superconducting phase can very naturally be stabilized near the plateau transition for the square vortex lattice. The relevance of our findings to potential near-term experiments on proximitized materials such as bismuth will be discussed.

cond-mat.mes-hall

Signatures of gapless fermionic spinons on a strip of the kagome Heisenberg antiferromagnet

The search for exotic quantum spin liquid states in simple yet realistic spin models remains a central challenge in the field of frustrated quantum magnetism. Here we consider the canonical nearest-neighbor kagome Heisenberg antiferromagnet restricted to a quasi-1D strip consisting entirely of corner-sharing triangles. Using large-scale density matrix renormalization group calculations, we identify in this model an extended gapless quantum phase characterized by central charge $c=2$ and power-law decaying spin and bond-energy correlations which oscillate at tunably incommensurate wave vectors. We argue that this intriguing spin liquid phase can be understood as a marginal instability of a two-band spinon Fermi surface coupled to an emergent U(1) gauge field, an interpretation which we substantiate via bosonization analysis and Monte Carlo calculations on model Gutzwiller variational wave functions. Our results represent one of the first numerical demonstrations of emergent fermionic spinons in a simple SU(2) invariant nearest-neighbor Heisenberg model beyond the strictly 1D (Bethe chain) limit.

cond-mat.str-el

Numerical exploration of trial wave functions for the particle-hole-symmetric Pfaffian

We numerically assess model wave functions for the recently proposed particle-hole-symmetric Pfaffian (`PH-Pfaffian') topological order, a phase consistent with the recently reported thermal Hall conductance [Banerjee et al., Nature 559, 205 (2018)] at the ever enigmatic $ν=5/2$ quantum-Hall plateau. We find that the most natural Moore-Read-inspired trial state for the PH-Pfaffian, when projected into the lowest Landau level, exhibits a remarkable numerical similarity on accessible system sizes with the corresponding (compressible) composite Fermi liquid. Consequently, this PH-Pfaffian trial state performs reasonably well energetically in the half-filled lowest Landau level, but is likely not a good starting point for understanding the $ν=5/2$ ground state. Our results suggest that the PH-Pfaffian model wave function either encodes anomalously weak $p$-wave pairing of composite fermions or fails to represent a gapped, incompressible phase altogether.

cond-mat.str-el

Dynamics of Majorana-based qubits operated with an array of tunable gates

We study the dynamics of Majorana zero modes that are shuttled via local tuning of the electrochemical potential in a superconducting wire. By performing time-dependent simulations of microscopic lattice models, we show that diabatic corrections associated with the moving Majorana modes are quantitatively captured by a simple Landau-Zener description. We further simulate a Rabi-oscillation protocol in a specific qubit design with four Majorana zero modes in a single wire and quantify constraints on the timescales for performing qubit operations in this setup. Our simulations utilize a Majorana representation of the system, which greatly simplifies simulations of superconductors at the mean-field level.

cond-mat.mes-hall

Partial breakdown of quantum thermalization in a Hubbard-like model

We study the possible breakdown of quantum thermalization in a model of itinerant electrons on a one-dimensional chain without disorder, with both spin and charge degrees of freedom. The eigenstates of this model exhibit peculiar properties in the entanglement entropy, the apparent scaling of which is modified from a "volume law" to an "area law" after performing a partial, site-wise measurement on the system. These properties and others suggest that this model realizes a new, non-thermal phase of matter, known as a quantum disentangled liquid (QDL). The putative existence of this phase has striking implications for the foundations of quantum statistical mechanics.

cond-mat.stat-mech