A5036216409- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum and electron transport phenomena
- Advancements in Semiconductor Devices and Circuit Design
- Cold Atom Physics and Bose-Einstein Condensates
- Quantum many-body systems
- graph theory and CDMA systems
- Blind Source Separation Techniques
- Parallel Computing and Optimization Techniques
- Machine Learning and Algorithms
- Mathematical Approximation and Integration
- Blockchain Technology in Education and Learning
- Low-power high-performance VLSI design
- Cellular Automata and Applications
- Quantum chaos and dynamical systems
- Quantum optics and atomic interactions
- Advanced Data Storage Technologies
- Complexity and Algorithms in Graphs
- Advanced Memory and Neural Computing
- Quantum-Dot Cellular Automata
University of Chicago
2020-2024
University of Illinois Chicago
2020-2024
La Jolla Alcohol Research
2023
Vassar College
2023
One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity gates. There are many reasons gate can go wrong - for superconducting transmon qubits particular, one major source error unwanted crosstalk between neighboring due phenomenon called frequency crowding. We motivate systematic approach understanding and mitigating noise when executing near-term programs on NISQ computers. present general software solution...
Abstract Running quantum algorithms protected by error correction requires a real time, classical decoder. To prevent the accumulation of backlog, this decoder must process syndromes from device at faster rate than they are generated. Most prior work on time decoding has focused an isolated logical qubit encoded in surface code. However, for code, programs utility will require multi-qubit interactions performed via lattice surgery. A large merged patch can arise during surgery — possibly as...
The overheads of classical decoding for quantum error correction in cryogenic systems grow rapidly with the number logical qubits and their code distance. Decoding at room temperature is bottlenecked by refrigerator I/O bandwidth while on-chip limited area/power/thermal budget.
Fabrication errors pose a significant challenge in scaling up solid-state quantum devices to the sizes required for fault-tolerant (FT) applications. To mitigate resource overhead caused by fabrication errors, we combine two approaches: (1) leveraging flexibility of modular architecture, (2) adapting procedure error correction (QEC) account defects.
Near-term quantum computers are primarily limited by errors in operations (or gates) between two bits qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) can be implemented given technology. 2Q entangling gates, coupled with some 1Q allow for universal computation. In superconducting technologies, the current state art is to implement same gate every pair qubits (typically an XX-or XY-type gate). This strict hardware...
In order to achieve error rates necessary for advantageous quantum algorithms, Quantum Error Correction (QEC) will need be employed, improving logical qubit fidelity beyond what can achieved physically. As today's devices begin scale, co-designing architectures QEC with the underlying hardware reduce daunting overheads and accelerate realization of practical computing. this work, we focus on computation in QEC. We address computers made from neutral atom arrays design a surface code...
Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Computation (FTQC) offering significant potential albeit at currently intractable resource costs and quantum error correction (QEC) overheads. For problems interest, FTQC will require millions physical qubits long coherence times, high-fidelity gates, compact sizes to surpass classical systems. Just as heterogeneous specialization offered scaling benefits...
The overheads of classical decoding for quantum error correction on superconducting systems grow rapidly with the number logical qubits and their code distance. Decoding at room temperature is bottle-necked by refrigerator I/O bandwidth while cryogenic on-chip limited area/power/thermal budget. To overcome these overheads, we are motivated observation that in common case, signatures fairly trivial high redundancy/sparsity, since codes over-provisioned to correct uncommon worst-case complex...
Running quantum algorithms protected by error correction requires a real time, classical decoder. To prevent the accumulation of backlog, this decoder must process syndromes from device at faster rate than they are generated. Most prior work on time decoding has focused an isolated logical qubit encoded in surface code. However, for code, programs utility will require multi-qubit interactions performed via lattice surgery. A large merged patch can arise during surgery -- possibly as entire...
Fault-tolerant quantum computation relies on the assumption of time-invariant, sufficiently low physical error rates. However, current superconducting computers suffer from frequent disruptive noise events, including cosmic ray impacts and shifting two-level system defects. Several methods have been proposed to mitigate these issues in software, but they add large overheads terms qubit count, as it is difficult preserve logical information through burst events. We focus mitigating...
Unitary <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>t</a:mi></a:math>-designs are distributions on the unitary group whose first <d:math xmlns:d="http://www.w3.org/1998/Math/MathML" overflow="scroll"><d:mi>t</d:mi></d:math> moments appear maximally random. Previous work has established several upper bounds depths at which certain specific random quantum circuit ensembles approximate <g:math xmlns:g="http://www.w3.org/1998/Math/MathML"...
Despite the necessity of fault-tolerant quantum sys- tems built on error correcting codes, many popular such as surface code, have prohibitively large qubit costs. In this work we present a protocol for efficiently implementing restricted set space-efficient (QEC) codes in atom arrays. This enables generalized-bicycle that require up to 10x fewer physical qubits than codes. Additionally, our logical cycles are 2-3x faster more general solutions space- efficient QEC We also evaluate...
We develop general purpose algorithms for computing and utilizing both the Dyson series Magnus expansion, with goal of facilitating numerical perturbative studies quantum dynamics. To enable broad applications to models multiple parameters, we phrase our in terms multivariable sensitivity analysis, either solution or time-averaged generator evolution over a fixed time-interval. These tools simultaneously compute collection up arbitrary order, are sense that model can depend on parameters an...
Fabrication errors pose a significant challenge in scaling up solid-state quantum devices to the sizes required for fault-tolerant (FT) applications. To mitigate resource overhead caused by fabrication errors, we combine two approaches: (1) leveraging flexibility of modular architecture, (2) adapting procedure error correction (QEC) account defects. We simulate surface code adapted qubit arrays with arbitrarily distributed defects find metrics that characterize how affect fidelity. then...
Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds depths at which certain specific random quantum circuit ensembles approximate t-designs. Here we show that these can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating spectral gaps such architectures those 1D brickwork architectures. Our bound depends details only via typical number...
Noisy Intermediate-Scale Quantum Computing (NISQ) has dominated headlines in recent years, with the longer-term vision of Fault-Tolerant Computation (FTQC) offering significant potential albeit at currently intractable resource costs and quantum error correction (QEC) overheads. For problems interest, FTQC will require millions physical qubits long coherence times, high-fidelity gates, compact sizes to surpass classical systems. Just as heterogeneous specialization offered scaling benefits...
Near-term quantum computers are primarily limited by errors in operations (or gates) between two bits qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) can be implemented given technology. 2Q entangling gates, coupled with some 1Q allow for universal computation. In superconducting technologies, the current state art is to implement same gate every pair qubits (typically an XX- or XY-type gate). This strict hardware...