Mapping the phase diagram of the quantum anomalous Hall and topological Hall effects in a dual-gated magnetic topological insulator heterostructure
Not Available
Xiao, Run (ORCID:0000000285436502)↗
SEARCH · Engineering Papers
Results for “quantum gates”
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.
Toward coherent quantum computation of scattering amplitudes with a measurement-based photonic quantum processor
In recent years, applications of quantum simulation have been developed to study the properties of strongly interacting theories. This has been driven by two factors: on the one hand, needs from theorists to have access to physical observables that are prohibitively difficult to study using classical computing; on the other hand, quantum hardware becoming increasingly reliable and scalable to larger systems. In this work, we discuss the feasibility of using quantum optical simulation for studying scattering observables that are presently inaccessible via lattice QCD and are at the core of the experimental program at Jefferson Laboratory, the future Electron-Ion Collider, and other accelerator facilities. We show that recent progress in measurement-based photonic quantum computing can be leveraged to provide deterministic generation of required exotic gates and implementation in a single photonic quantum processor. Published by the American Physical Society 2024
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Analog-to-digital converter based on voltage-controlled superconducting devices
The increasing demand for cryogenic electronics in superconducting and quantum computing systems calls for ultra-energy-efficient data conversion architectures that remain functional at deep cryogenic temperatures. Here, in this work, we present the first design of a voltage-controlled superconducting flash analog-to-digital converter (ADC) based on a voltage-controlled quantum-enhanced Josephson junction field-effect transistor (JJFET). Exploiting its strong gate tunability and transistor-like behavior, the JJFET offers a scalable alternative to conventional current-controlled superconducting devices while aligning naturally with CMOS-style design methodologies. Building on our previously developed Verilog-A compact model calibrated to experimental data, we design and simulate a three-bit JJFET-based flash ADC targeted for integration within cryogenic control and readout circuitry in quantum computing. The core comparator block is realized through careful bias current selection and augmented with a three-terminal nanocryotron to precisely define reference voltages. Cascaded JJFET comparators ensure robust voltage gain, cascadability, and logic-level restoration across stages. Simulation results demonstrate accurate quantization behavior with ultra-low power dissipation, underscoring the feasibility of voltage-driven superconducting mixed-signal circuits. This work establishes a critical step toward unifying superconducting logic and data conversion, paving the way for scalable cryogenic architectures in quantum–classical co-processors, low-power artificial intelligence accelerators, and next-generation energy-constrained computing platforms.
Analog-to-digital converter↗
Universal quantum operation of spin-3/2 Blume-Capel chains
We propose a logical qubit based on the Blume-Capel model: A higher-spin generalization of the Ising chain which allows for an on-site anisotropy-preserving rotational invariance around the Ising axis. We show that such a spin-3/2 Blume-Capel model can also support localized Majorana zero modes at the ends of the chain. Inspired by known braiding protocols of these Majorana zero modes, upon appropriate manipulation of the system parameters, we demonstrate a set of universal gate operations which act on qubits encoded in the doubly degenerate ground states of the chain.
1-dimensional spin chains↗
Toward Consistent High-Fidelity Quantum Learning on Unstable Devices via Efficient In-Situ Calibration
In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. What's worse, recent works reveal that the noise on quantum devices is not stable, that is, the noise is dynamically changing over time. This leads to an imminent challenging problem: At run-time, is there a way to efficiently achieve a consistent high-fidelity quantum system on unstable devices? To study this problem, we take quantum learning (a.k.a., variational quantum algorithm) as a vehicle, which has a wide range of applications, such as combinatorial optimization and machine learning. A straightforward approach is to optimize a variational quantum circuit (VQC) with a parameter-shift approach on the target quantum device before using it; however, the optimization has an extremely high time cost, which is not practical at run-time. To address the pressing issue, in this paper, we proposed a novel quantum pulse-based noise adaptation framework, namely QuPAD. In the proposed framework, first, we identify that the CNOT gate is the fidelity bottleneck of the conventional VQC, and we employ a more robust parameterized multi-qubit gate (i.e., Rzx gate) to replace CNOT gate. Second, by benchmarking Rzx gate with different parameters, we build a fitting function for each coupling qubit pair, such that the deviation between the theoretic output of Rzx gate and its on-device output under a given pulse amplitude and duration can be efficiently predicted. On top of this, an evolutionary algorithm is devised to identify the pulse amplitude and duration of each Rzx gate (i.e., calibration) and find the quantum circuits with high fidelity. Experiments show that the runtime on quantum devices of QuPAD with 8–10 qubits is less than 15 minutes, which is up to 270 x faster than the parameter-shift approach. In addition, compared to the vanilla VQC as a baseline, QuPAD can achieve 59.33% accuracy gain on a classification task, and average 66.34% closer to ground state energy for molecular simulation.
Hu, Zhirui↗
State Dependent Optimization with Quantum Circuit Cutting
Quantum circuits can be reduced through optimization to better fit the constraints of quantum hardware. One such method, initial-state dependent optimization (ISDO), reduces gate count by leveraging knowledge of the input quantum states. Surprisingly, we found that ISDO is broadly applicable to the downstream circuits produced by circuit cutting. Circuit cutting also requires measuring upstream qubits and has some flexibility of selection observables to do reconstruction. Therefore, we propose a state-dependent optimization (SDO) framework that incorporates ISDO, our newly proposed measure-state dependent optimization (MSDO), and a biased observable selection strategy. Building on the strengths of the SDO framework and recognizing the scalability challenges of circuit cutting, we propose nonseparate circuit cutting-a more flexible approach that enables optimizing gates without fully separating them. We validate our methods on noisy simulations of QAOA, QFT, and BV circuits. Results show that our approach consistently mitigates noise and improves overall circuit performance, demonstrating its promise for enhancing quantum algorithm execution on near-term hardware.
Li, Xinpeng↗
Two-qubit silicon quantum processor with operation fidelity exceeding 99%
Silicon spin qubits satisfy the necessary criteria for quantum information processing. However, a demonstration of high-fidelity state preparation and readout combined with high-fidelity single- and two-qubit gates, all of which must be present for quantum error correction, has been lacking. We use a two-qubit Si/SiGe quantum processor to demonstrate state preparation and readout with fidelity greater than 97%, combined with both single- and two-qubit control fidelities exceeding 99%. The operation of the quantum processor is quantitatively characterized using gate set tomography and randomized benchmarking. Finally, our results highlight the potential of silicon spin qubits to become a dominant technology in the development of intermediate-scale quantum processors.
97 MATHEMATICS AND COMPUTING↗
QUEST: systematically approximating Quantum circuits for higher output fidelity
We present QUEST, a procedure to systematically generate approximations for quantum circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for scalability with procedures to 1) reduce circuit length using approximate synthesis, 2) improve fidelity by running circuits that represent key samples in the approximation space, and 3) reason about approximation upper bound. Our evaluation results indicate that our approach of "dissimilar"approximations provides close fidelity to the original circuit. Overall, the results indicate that QUEST can reduce CNOT gate count by 30-80% on ideal systems and decrease the impact of noise on existing and near-future quantum systems.
Patel, Tirthak↗
Noise resilience of variational quantum compiling
Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗
Programming correlated magnetic states with gate-controlled moiré geometry
The ability to control the underlying lattice geometry of a system may enable transitions between emergent quantum ground states. We report in situ gate switching between honeycomb and triangular lattice geometries of an electron many-body Hamiltonian in rhombohedral (R)–stacked molybdenum ditelluride (MoTe 2 ) moiré bilayers, resulting in switchable magnetic exchange interactions. At zero electric field, we observed a correlated ferromagnetic insulator near one hole per moiré unit cell with a widely tunable Curie temperature up to 14 K. Applying an electric field switched the system into a half-filled triangular lattice with antiferromagnetic interactions; further doping this layer-polarized superlattice tuned the antiferromagnetic exchange interaction back to ferromagnetic. Our work demonstrates R-stacked MoTe 2 moirés to be a laboratory for engineering correlated states with nontrivial topology.
Science & Technology - Other Topics↗
Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems
The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.
quantum computing, Harrow-Hassidim-Lloyd, high-per↗
A non-orthogonal variational quantum eigensolver
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).
97 MATHEMATICS AND COMPUTING↗
Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse
Quantum computers are traditionally operated by programmers at the granularity of a gate-based instruction set. However, the actual device-level control of a quantum computer is performed via analog pulses. Here, we introduce a compiler that exploits direct control at this microarchitectural level to achieve significant improvements for quantum programs. Unlike quantum optimal control, our approach is bootstrapped from existing gate calibrations and the resulting pulses are simple. Our techniques are applicable to any quantum computer and realizable on current devices. We validate our techniques with millions of experimental shots on IBM quantum computers, controlled via the OpenPulse control interface. For representative benchmarks, our pulse control techniques achieve both 1.6x lower error rates and 2x faster execution time, relative to standard gate-based compilation. These improvements are critical in the near-term era of quantum computing, which is bottlenecked by error rates and qubit lifetimes.
Gokhale, Pranav↗
Scattering Processes from Quantum Simulation Algorithms for Scalar Field Theories
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve these improvements through two optimizations. First, we consider a finite volume approach for estimating the elements of the S-matrix. This approach is appropriate in general for 1+1D and for certain low-energy elastic collisions in higher dimensions. Second, we implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians formulated both in the field occupation basis and field amplitude basis. Our algorithms are based on either second-order Trotterization or qubitization. The cost of Trotterization in occupation basis scales as O ( λ N 7 | Ω | 3 / ( M 5 / 2 ϵ 3 / 2 ) ) where λ is the coupling strength, N is the occupation cutoff, | Ω | is the volume of the spatial lattice, M is the mass of the particles and ϵ is the uncertainty in the energy calculation used for the S -matrix determination. Qubitization in the field basis scales as O ( | Ω | 2 ( k 2 Λ + k M 2 ) / ϵ ) , where k is the cutoff in the field and Λ is a scaled coupling constant. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of 4 × 10 6 physical qubits and 10 12 T -gates which corresponds to roughly one day on a superconducting quantum computer with surface code and a cycle time of 100 ns. This places the simulation of scalar field theory within striking distance of the gate counts for the best available chemistry simulation results.
Hardy, Andrew [Toronto U.] (ORCID:0000000235817382↗
Variational Optical Phase Learning on a Continuous-Variable Quantum Compiler
Quantum process learning is a fundamental primitive that draws inspiration from machine learning with the goal of better studying the dynamics of quantum systems. One approach to quantum process learning is quantum compilation, whereby an analog quantum operation is digitized by compiling it into a series of basic gates. While there has been significant focus on quantum compiling for discrete-variable systems, the continuous-variable (CV) framework has received comparatively less attention. We present an experimental implementation of a CV quantum compiler that uses two-mode squeezed light to learn a Gaussian unitary operation. We demonstrate the compiler by learning a parameterized linear phase unitary through the use of target and control phase unitaries to demonstrate a factor of 5.4 increase in the precision of the phase estimation and a 3.6-fold acceleration in the time-to-solution metric when leveraging quantum resources. We further show how our approach can be extended to higher-dimensional compilation tasks. Our results are enabled by the tunable control of our cost landscape via variable squeezing, thus providing a critical framework to simultaneously increase precision and reduce time-to-solution.
97 MATHEMATICS AND COMPUTING↗
Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.
97 MATHEMATICS AND COMPUTING↗
Pathfinding quantum simulations of neutrinoless double- β decay
We present results from co-designed quantum simulations of the neutrinoless double- β decay of a simple nucleus in 1+1D quantum chromodynamics using IonQ’s Forte-generation trapped-ion quantum computers. Electrons, neutrinos, and up and down quarks are distributed across two lattice sites and mapped to 32 qubits, with an additional 4 qubits used for flag-based error mitigation. A four-fermion interaction is used to implement weak interactions, and lepton-number violation is induced by a neutrino Majorana mass. Quantum circuits that prepare the initial nucleus and time evolve with the Hamiltonian containing the strong and weak interactions are executed on IonQ Forte Enterprise. Enabled by tuned model parameters, lepton-number violation is observed in real time, providing a clear signal of neutrinoless double- β decay. This was made possible by co-designing the simulation to maximally utilize the all-to-all connectivity and native gate-set available on IonQ’s quantum computers. Quantum circuit compilation techniques and co-designed error-mitigation methods, informed from executing benchmarking circuits with up to 2,356 two-qubit gates, enabled observables to be extracted with high precision. We discuss the potential of future quantum simulations to provide yocto-second resolution of the reaction pathways in these, and other, nuclear processes.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗