arXiv subjects

Tyler LeBlond

Publications and source records attributed to Tyler LeBlond.

11 recordsLinked to original sources

arXiv2025

Logical Error Rates for the Surface Code Under a Mixed Coherent and Stochastic Circuit-Level Noise Model Inspired by Trapped Ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical error in plausible hardware implementations of quantum error-correcting codes (QECC). In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device (QCCD) architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of the trapped-ion surface code compiler (TISCC). To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasi-probability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance $d=11$ at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at $d=3-5$, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of a FTQC instruction set.

quant-ph↗

arXiv2025

Quantum Resource Comparison for Two Leading Surface Code Lattice Surgery Approaches

Hamiltonian simulation is one of the most promising candidates for the demonstration of quantum advantage within the next ten years, and several studies have proposed end-to-end resource estimates for executing such algorithms on fault-tolerant quantum processors. Usually, these resource estimates are based upon the assumption that quantum error correction is implemented using the surface code, and that the best surface code compilation scheme involves serializing input circuits by eliminating all Clifford gates. This transformation is thought to make best use of the native multi-body measurement (lattice surgery) instruction set available to surface codes. Some work, however, has suggested that direct compilation from Clifford+T to lattice surgery operations may be beneficial for circuits that have high degrees of logical parallelism. In this study, we analyze the resource costs for implementing Hamiltonian simulation using example approaches from each of these leading surface code compilation families. The Hamiltonians whose dynamics we consider are those of the transverse-field Ising model in several geometries, the Kitaev honeycomb model, and the $\mathrm{\alpha-RuCl_3}$ complex under a time-varying magnetic field. We show, among other things, that the optimal scheme depends on whether Hamiltonian simulation is implemented using the quantum signal processing or Trotter-Suzuki algorithms, with Trotterization benefiting by orders of magnitude from direct Clifford+T compilation for these applications. Our results suggest that surface code quantum computers should not have a one-size-fits-all compilation scheme, but that smart compilers should predict the optimal scheme based upon high-level quantities from logical circuits such as average circuit density, numbers of logical qubits, and T fraction.

quant-ph↗

arXiv2024

On the Need for Extensible Quantum Compilers with Verification

In this position paper, we posit that a major Department of Energy (DOE)-funded open-source quantum compilation platform is needed to facilitate: (a) resource optimization at the fault-tolerant layer of the quantum computing software stack, and (b) co-design of that layer of the stack with other layers, and that this platform needs to be extensible and include verification.

quant-ph↗

arXiv2023

TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors

We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal representation of a trapped-ion system where a repeating pattern of trapping zones and junctions is arranged in an arbitrarily large rectangular grid. Surface code operations are compiled by instantiating surface code patches on the grid and using methods to generate transversal operations over data qubits, rounds of error correction over stabilizer plaquettes, and/or lattice surgery operations between neighboring patches. Beyond the implementation of a basic surface code instruction set, TISCC contains corner movement functionality and a patch translation that is implemented using ion movement alone. Except in the latter case, all TISCC functionality is extensible to alternative grid-like hardware architectures. TISCC output has been verified using the Oak Ridge Quasi-Clifford Simulator (ORQCS).

quant-ph↗

arXiv2023

Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large, practical quantum circuits by providing resource estimates for the ground state estimation of molecules. We find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

quant-ph↗

arXiv2023

Probing the Transition to Dataset-Level Privacy in ML Models Using an Output-Specific and Data-Resolved Privacy Profile

Differential privacy (DP) is the prevailing technique for protecting user data in machine learning models. However, deficits to this framework include a lack of clarity for selecting the privacy budget $ε$ and a lack of quantification for the privacy leakage for a particular data row by a particular trained model. We make progress toward these limitations and a new perspective by which to visualize DP results by studying a privacy metric that quantifies the extent to which a model trained on a dataset using a DP mechanism is ``covered" by each of the distributions resulting from training on neighboring datasets. We connect this coverage metric to what has been established in the literature and use it to rank the privacy of individual samples from the training set in what we call a privacy profile. We additionally show that the privacy profile can be used to probe an observed transition to indistinguishability that takes place in the neighboring distributions as $ε$ decreases, which we suggest is a tool that can enable the selection of $ε$ by the ML practitioner wishing to make use of DP.

cs.LG↗

arXiv2023

A General Framework for Auditing Differentially Private Machine Learning

We present a framework to statistically audit the privacy guarantee conferred by a differentially private machine learner in practice. While previous works have taken steps toward evaluating privacy loss through poisoning attacks or membership inference, they have been tailored to specific models or have demonstrated low statistical power. Our work develops a general methodology to empirically evaluate the privacy of differentially private machine learning implementations, combining improved privacy search and verification methods with a toolkit of influence-based poisoning attacks. We demonstrate significantly improved auditing power over previous approaches on a variety of models including logistic regression, Naive Bayes, and random forest. Our method can be used to detect privacy violations due to implementation errors or misuse. When violations are not present, it can aid in understanding the amount of information that can be leaked from a given dataset, algorithm, and privacy specification.

cs.LG↗

arXiv2021

Universality in the onset of quantum chaos in many-body systems

We show that the onset of quantum chaos at infinite temperature in two many-body one-dimensional lattice models, the perturbed spin-1/2 XXZ and Anderson models, is characterized by universal behavior. Specifically, we show that the onset of quantum chaos is marked by maxima of the typical fidelity susceptibilities that scale with the square of the inverse average level spacing, saturating their upper bound, and that the strength of the integrability- or localization-breaking perturbation at these maxima decreases with increasing system size. We also show that the spectral function below the ``Thouless'' energy (in the quantum-chaotic regime) diverges when approaching those maxima. Our results suggest that, in the thermodynamic limit, arbitrarily small integrability- or localization-breaking perturbations result in quantum chaos in the many-body quantum systems studied here.

cond-mat.stat-mech↗

arXiv2020

Eigenstate thermalization for observables that break Hamiltonian symmetries and its counterpart in interacting integrable systems

We study the off-diagonal matrix elements of observables that break the translational symmetry of a spin-chain Hamiltonian, and as such connect energy eigenstates from different total quasimomentum sectors. We consider quantum-chaotic and interacting integrable points of the Hamiltonian, and focus on average energies at the center of the spectrum. In the quantum-chaotic model, we find that there is eigenstate thermalization; specifically, the matrix elements are Gaussian distributed with a variance that is a smooth function of $ω=E_α-E_β$ ({$E_α$} are the eigenenergies) and scales as $1/D$ ($D$ is the Hilbert space dimension). In the interacting integrable model, we find that the matrix elements exhibit a skewed log-normal-like distribution and have a variance that is also a smooth function of $ω$ that scales as $1/D$. We study in detail the low-frequency behavior of the variance of the matrix elements to unveil the regimes in which it exhibits diffusive or ballistic scaling. We show that in the quantum-chaotic model the behavior of the variance is qualitatively similar for matrix elements that connect eigenstates from the same versus different quasimomentum sectors. We also show that this is not the case in the interacting integrable model for observables whose translationally invariant counterpart does not break integrability if added as a perturbation to the Hamiltonian.

cond-mat.stat-mech↗

arXiv2020

Eigenstate Thermalization in a Locally Perturbed Integrable System

Eigenstate thermalization is widely accepted as the mechanism behind thermalization in generic isolated quantum systems. Using the example of a single magnetic defect embedded in the integrable spin-1/2 $XXZ$ chain, we show that locally perturbing an integrable system can give rise to eigenstate thermalization. Unique to such setups is the fact that thermodynamic and transport properties of the unperturbed integrable chain emerge in properties of the eigenstates of the perturbed (nonintegrable) one. Specifically, we show that the diagonal matrix elements of observables in the perturbed eigenstates follow the microcanonical predictions for the integrable model, and that the ballistic character of spin transport in the integrable model is manifest in the behavior of the off-diagonal matrix elements of the current operator in the perturbed eigenstates.

cond-mat.stat-mech↗

arXiv2019

Entanglement and matrix elements of observables in interacting integrable systems

We study the bipartite von Neumann entanglement entropy and matrix elements of local operators in the eigenstates of an interacting integrable Hamiltonian (the paradigmatic spin-1/2 XXZ chain), and we contrast their behavior with that of quantum chaotic systems. We find that the leading term of the average (over all eigenstates in the zero magnetization sector) eigenstate entanglement entropy has a volume-law coefficient that is smaller than the universal (maximal entanglement) one in quantum chaotic systems. This establishes the entanglement entropy as a powerful measure to distinguish integrable models from generic ones. Remarkably, our numerical results suggest that the volume-law coefficient of the average entanglement entropy of eigenstates of the spin-1/2 XXZ Hamiltonian is very close to, or the same as, the one for translationally invariant quadratic fermionic models. We also study matrix elements of local operators in the eigenstates of the spin-1/2 XXZ Hamiltonian at the center of the spectrum. For the diagonal matrix elements, we show evidence that the support does not vanish with increasing system size, while the average eigenstate-to-eigenstate fluctuations vanish in a power-law fashion. For the off-diagonal matrix elements, we show that they follow a distribution that is close to (but not quite) log-normal, and that their variance is a well-defined function of $ω=E_α-E_β$ ($\{E_α\}$ are the eigenenergies) proportional to $1/D$, where $D$ is the Hilbert space dimension.

cond-mat.stat-mech↗