Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Clifford”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Conformal field theories are magical

“Magic” is the degree to which a state cannot be approximated by Clifford gates. We study mana, a measure of magic, in the ground state of the Z 3 Potts model, and argue that it is a broadly useful diagnostic for many-body physics. In particular we find that the q = 3 ground state has large mana at the model's critical point, and that this mana resides in the system's correlations. Here, we explain the form of the mana by a simple tensor-counting calculation based on a MERA representation of the state. Because mana is present at all length scales, we conclude that the conformal field theory describing the three-state Potts model critical point is magical. These results control the difficulty of preparing the Potts ground state on an error-corrected quantum computer and constrain tensor network models of AdS-CFT.

1-dimensional spin chains↗

Triviality of quantum trajectories close to a directed percolation transition

Here we study quantum circuits consisting of unitary gates, projective measurements, and control operations that steer the system toward a pure absorbing state. Two types of phase transition occur as the rate of these control operations is increased: a measurement-induced entanglement transition, and a directed percolation transition into the absorbing state (taken here to be a product state). In this work, we show analytically that these transitions are generically distinct, with the quantum trajectories becoming disentangled before the absorbing state transition is reached, and we analyze their critical properties. We introduce a simple class of models where the measurements in each quantum trajectory define an effective tensor network (ETN)—a subgraph of the initial spacetime graph where nontrivial time evolution takes place. By analyzing the entanglement properties of the ETN, we show that the entanglement and absorbing-state transitions coincide only in the limit of the infinite local Hilbert-space dimension. Focusing on a Clifford model which allows numerical simulations for large system sizes, we verify our predictions and study the finite-size crossover between the two transitions at large local Hilbert space dimension. We give evidence that the entanglement transition is governed by the same fixed point as in hybrid circuits without feedback.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Cross Entropy Benchmark for Measurement-Induced Phase Transitions

Here, we investigate prospects of employing the linear cross entropy to experimentally access measurement-induced phase transitions without requiring any postselection of quantum trajectories. For two random circuits that are identical in the bulk but with different initial states, the linear cross entropy χ between the bulk measurement outcome distributions in the two circuits acts as an order parameter, and can be used to distinguish the volume law from area law phases. In the volume law phase (and in the thermodynamic limit) the bulk measurements cannot distinguish between the two different initial states, and χ = 1. In the area law phase χ < 1. For circuits with Clifford gates, we provide numerical evidence that χ can be sampled to accuracy ϵ from O⁢(1/ϵ 2 ) trajectories, by running the first circuit on a quantum simulator without postselection, aided by a classical simulation of the second. We also find that for weak depolarizing noise the signature of the measurement-induced phase transitions is still present for intermediate system sizes. In our protocol we have the freedom of choosing initial states such that the “classical” side can be simulated efficiently, while simulating the “quantum” side is still classically hard.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite-Time Teleportation Phase Transition in Random Quantum Circuits

How long does it take to entangle two distant qubits in a quantum circuit evolved by generic unitary dynamics? Here, we show that if the time evolution is followed by measurements of all but two infinitely separated test qubits, then the entanglement between them can undergo a phase transition and become nonzero at a finite critical time t c . The fidelity of teleporting a quantum state from an input qubit to an infinitely distant output qubit shows the same critical onset. Specifically, these finite-time transitions occur in short-range interacting two-dimensional random unitary circuits and in sufficiently long-range interacting one-dimensional circuits. The phase transition is understood by mapping the random continuous-time evolution to a finite-temperature thermal state of an effective spin Hamiltonian, where the inverse temperature equals the evolution time in the circuit. In this framework, the entanglement between two distant qubits at times t > t c corresponds to the emergence of long-range ferromagnetic spin correlations below the critical temperature. We verify these predictions using numerical simulation of Clifford circuits and propose potential realizations in existing platforms for quantum simulation.

36 MATERIALS SCIENCE↗

Equivalence between Fermion-to-Qubit Mappings in two Spatial Dimensions

We argue that all locality-preserving mappings between fermionic observables and Pauli matrices on a two-dimensional lattice can be generated from the exact bosonization in Chen et al., whose gauge constraints project onto the subspace of the toric code with emergent fermions. Starting from the exact bosonization and applying Clifford finite-depth generalized local unitary transformation, we can achieve all possible fermion-to-qubit mappings (up to the re-pairing of Majorana fermions). In particular, we discover a new supercompact encoding using 1.25 qubits per fermion on the square lattice. We prove the existence of finite-depth quantum circuits to obtain fermion-to-qubit mappings with qubit-fermion ratios r = 1 + 1/2k for positive integers k, utilizing the trivialness of quantum cellular automata in two spatial dimensions. Also, we provide direct constructions of fermion-to-qubit mappings with ratios arbitrarily close to 1. When the ratio reaches 1, the fermion-to-qubit mapping reduces to the one-dimensional Jordan-Wigner transformation along a certain path in the two-dimensional lattice. Finally, we explicitly demonstrate that the Bravyi-Kitaev superfast simulation, the Verstraete-Cirac auxiliary method, Kitaev’s exactly solved model, the Majorana loop stabilizer codes, and the compact fermion-to-qubit mapping can all be obtained from the exact bosonization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits

In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes. In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior. We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space. This mapping predicts mean-field critical exponents v=–1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Engineering 3D Floquet Codes by Rewinding

Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of noncommuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as the three-dimensional (3D) toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of the 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of the 3D toric code up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of the 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford controlled-controlled- Z gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite depth equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to three dimensions, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code. Published by the American Physical Society2024

Physics↗

Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code

We consider the Z 2 toric code, surface code, and Floquet code defined on a nonorientable surface, which can be considered as families of codes extending Shor’s nine-qubit code. We investigate the fault-tolerant logical gates of the Z 2 toric code in this setup, which corresponds to e ↔ m exchanging symmetry of the underlying Z 2 gauge theory. We find that nonorientable geometry provides a new way for the emergent symmetry to act on the code space, and discover the new realization of the fault-tolerant Hadamard gate of the two-dimensional surface code with a single cross cap connecting the vertices nonlocally along a slit, dubbed a nonorientable surface code. This Hadamard gate can be realized by a constant-depth local unitary circuit modulo nonlocality caused by a cross cap. Via folding, the nonorientable surface code can be turned into a bilayer local quantum code, where the folded cross cap is equivalent to a bilayer twist terminated on a gapped boundary and the logical Hadamard only contains local gates with intralayer couplings when being away from the cross cap, as opposed to the interlayer couplings on each site needed in the case of the folded surface code. We further obtain the complete logical Clifford gate set for a stack of nonorientable surface codes and similarly for codes defined on Klein-bottle geometries. We then construct the honeycomb Floquet code in the presence of a single cross cap, and find that the period of the sequential Pauli measurements acts as a H Z logical gate on the single logical qubit, where the cross cap enriches the dynamics compared with the orientable case. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the Z 2 gauge theory, and illustrate the exotic dynamics of our code in terms of a condensation operator supported at a nonorientable surface. Published by the American Physical Society 2024

Physics↗

Fully Scalable Randomized Benchmarking Without Motion Reversal

We introduce , a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods. Published by the American Physical Society 2024

Hines, Jordan (ORCID:0000000151267256)↗

Generalized Cycle Benchmarking Algorithm for Characterizing Midcircuit Measurements

Midcircuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is still under exploration. In this work, we develop a cycle benchmarking (CB)-type algorithm to characterize noisy MCMs. The key idea is to use a joint Fourier transform on the classical and quantum registers and then estimate parameters in the Fourier space, analogous to Pauli fidelities used in CB-type algorithms for characterizing the Pauli-noise channel of Clifford gates. Furthermore, we develop a theory of the noise learnability of MCMs, which determines what information can be learned about the noise model (in the presence of state preparation and terminating measurement noise) and what cannot, which shows that all learnable information can be learned using our algorithm. As an application, we show how to use the learned information to test the independence between measurement noise and state-preparation noise in an MCM. Finally, we conduct numerical simulations to illustrate the practical applicability of the algorithm. Similar to other CB-type algorithms, we expect the algorithm to provide a useful toolkit that is of experimental interest. Published by the American Physical Society 2025

Zhang, Zhihan (ORCID:0009000862907691)↗

High-Power Clock Laser Spectrally Tailored for High-Fidelity Quantum State Engineering

Highly frequency-stable lasers are ubiquitous tools for optical-frequency metrology, precision interferometry, and quantum information science. While making a universally applicable laser is unrealistic, spectral noise can be tailored for specific applications. Here we report a high-power 698-nm clock laser with a maximum output of 4W and minimized frequency noise up to a few kHz Fourier frequency, together with long-term instability of 3.5 × 10 −17 at one to thousands of seconds. The laser-frequency noise is precisely characterized with atom-based spectral analysis that employs a pulse sequence designed to suppress sensitivity to intensity noise. This method provides universally applicable tunability of the spectral response and analysis of quantum sensors over a wide frequency range. With the optimized laser system characterized by this technique, we achieve an average single-qubit Clifford gate fidelity of up to 𝐹$^2_1$ = 0.999⁢64⁢(3) when simultaneously driving 3000 optical qubits with a homogeneous Rabi frequency ranging from 10 Hz to 1 kHz. This result represents the highest single optical-qubit-gate fidelity for a large number of atoms.

atomic gases↗

Automatic Qubit Characterization and Gate Optimization with QubiC

As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits and gates, which cannot easily expand to the large-scale quantum systems. We develop a concise and automatic calibration protocol to characterize qubits and optimize gates using QubiC, which is an open source FPGA (field-programmable gate array) based control and measurement system for superconducting quantum information processors. We propose multi-dimensional loss-based optimization of single-qubit gates and full XY-plane measurement method for the two-qubit CNOT gate calibration. We demonstrate the QubiC automatic calibration protocols are capable of delivering high-fidelity gates on the state-of-the-art transmon-type processor operating at the Advanced Quantum Testbed at Lawrence Berkeley National Laboratory. Finally, the single-qubit and two-qubit Clifford gate infidelities measured by randomized benchmarking are of 4.9(1.1) × 10 -4 and 1.4(3) × 10 -2 , respectively.

97 MATHEMATICS AND COMPUTING↗

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).

LeBlond, Tyler↗

Stabilizer Rank Strong Simulation v.0.1

This software improves upon the Clifford gate+T gate magic state strong simulation algorithm by Brayvi and Gosset. It provides a better stabilizer state decomposition that scales as 2^{0.463t}, an improvement over 2^{0.468t}, for t T gate magic states. This code enables simulations of universal quantum computing with that asymptotic scaling cost. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525 SAND2020-14293 O

SciDAC↗

Gauss Sum Strong Simulation v.0.1

Universal quantum circuits can be formulated in the Pauli measurement-based formalism as input T gate magic states, Clifford gates, and then multi-Pauli measurements. This code simulates single-Pauli measurements to show some theoretical bounds on the cost of full multi-Pauli measurements. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2020-14080 O

SciDAC↗

ORNL-QCI/TISCC

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).

LeBlond, Tyler↗

NWQ-sim

NWQSim is a quantum circuit simulation environment developed at PNNL. It currently includes two major components: a state-vector simulator (SV-Sim) and a density matrix simulator (DM-Sim) and we may add more components, such as a Clifford simulator, in the future effort. NWQSim has two language interface: C/C++ and Python. It supports Q#/QDK frontend through QIR and QIR-runtime. It supports Qiskit and Cirq frontends through OpenQASM. NWQSim runs on several backends: Intel-CPU, Intel-Xeon-Phi, AMD-CPU, AMD-GPU, NVIDIA-GPU, and IBM-CPU. It supports three modes: (1) single processor, such as a single CPU (with and without AVX2 and AVX512 acceleration), a single NVIDIA GPU or a single AMD GPU; (2) single-node-multi-processors, such as multi-CPUs/Xeon-Phis, multi-NVIDA/AMD GPUs; (3) multi-nodes, such as a CPU cluster, a Xeon-Phi cluster (e.g., ANL Theta, NERSC Cori), an NVIDIA cluster (e.g., ORNL Summit, NERSC Perlmutter).

Li, Ang↗

Inexpensive and durable aerogel-based VIP cores

The goal of this project was development of low-cost aerogels to be used as cores of Vacuum Insulated Panels (VIP). The specific aims were: 1. Aerogels to be based on phenolic chemistry to minimize flammability. 2. Aerogels to be in monolithic form and to have mechanical properties sufficient to allow their use as cores of VIPs without collapsing after evacuation. 3. Aerogels to have a cost per kg lower than the cost of fumed silica, one of the most common VIP cores. The achievements are: 1. Phenolic aerogels have been fabricated in monolithic form with thermal conductivity of 0.023 W/m·K, density ~ 0.25 g/cm 3 and a modulus of compression > 10 MPa. The aerogels can withstand the stresses of VIP evacuation without any appreciable deformation. 2. Drying of aerogels was carried in the initial stages of the project via sublimation of frozen solvents, following the procedure described in M. F. Bertino and T. Selden, “Fabrication of Aerogels and Aerogel Composites by Ambient Pressure Sublimation of Frozen Solvents”, PCT/US20/39485. Monoliths as large as 30 x 30 x 2 cm can be fabricated with the proprietary ambient fabrication technique which are free of cracks and warping. 3. Cost analysis was carried out and refined multiple times, cost drivers were identified, and the fabrication procedure was streamlined. Our cost model yields an aerogel cost of $\$$5.78/kg, which compares well with the price of fumed silica ($\$$6.2/kg FOB New York as of March 2023). 4. The monoliths can be cut into custom shapes and used as VIP cores. Cores fabricated with our technique have a thermal conductivity λ = 0.011 W/m·K at a pressure >10 mbar. 5. A variant of the technology yielded fireproof materials, described in M. F. Bertino, T. Moon, G. Waller, J. Ko and D. Clifford, “Fireproof thermal insulation”, Provisional Patent Application 63/415,386. 6. A spin-off company was created (ThermaGel Innovations, Inc.) which licensed technologies developed under this award. PI Bertino is a board member of the newco which is now raising capital to build a pilot plant.

36 MATERIALS SCIENCE↗