Andrew Litteken

Andrew Litteken

Auto-generated profile, based on publicly available information

Andrew Litteken

Intel Corporation

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 April 2021
Verified
Conference Paper
Open access
CDCasey Duckering
Casey Duckering
JBJonathan M. Baker
Jonathan M. Baker
ALAndrew Litteken
Andrew Litteken
FCFred Chong
Fred Chong
Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. We perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types.

28 May 2020 in Quantum Science and Technology
Verified
Journal Article
Open access
PDF file
ALAndrew Litteken
Andrew Litteken
YFYung-Ching Fan
Yung-Ching Fan
DSDevina Singh
Devina Singh
MMMargaret R Martonosi
Margaret R Martonosi
FCFrederic T Chong
Frederic T Chong
Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput. 45 2–17), Abhari et al (2012 Scaffold: quantum programming language https://cs.princeton.edu/research/techreps/TR-934-12), have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.

17 June 2023
Verified
Conference Paper
Open access
ALAndrew Litteken
Andrew Litteken
LSLennart Maximilian Seifert
Lennart Maximilian Seifert
JCJason D. Chadwick
Jason D. Chadwick
NNNatalia Nottingham
Natalia Nottingham
TRTanay Roy
Tanay Roy
JBJonathan M. Baker
Jonathan M. Baker
Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices. We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation.

16 May 2025 in Physical Review A
Verified
Journal Article
Open access
JCJason D. Chadwick
Jason D. Chadwick
GGGian Giacomo Guerreschi
Gian Giacomo Guerreschi
FLFlorian Luthi
Florian Luthi
MMMateusz T. Mądzik
Mateusz T. Mądzik
FMFahd A. Mohiyaddin
Fahd A. Mohiyaddin
JCJames S. Clarke
James S. Clarke
Exchange-only (EO) spin qubits in quantum dots offer an expansive design landscape for engineering scalable device layouts. The study of two-EO-qubit operations, which involve six electrons in six quantum dots, has so far been limited to a small number of possible configurations, and previous works lack analyses of design considerations and implications for quantum error correction. Using a simple and fast optimization method, we generate complete pulse sequences for , , i , leakage-controlled , and leakage-controlled two-qubit gates on 450 unique planar six-dot topologies and analyze differences in sequence length (up to 43% reduction) across topology classes. In addition, we show that relaxing constraints on postoperation spin locations can yield further reductions in sequence length; conversely, constraining these locations in a particular way generates a operation with minimal additional cost over a standard . We integrate this pulse library into the Intel quantum stack and experimentally verify pulse sequences on a Tunnel Falls chip for different operations in a linear-connectivity device to confirm that they work as expected. Finally, we explore architectural implications of these results for quantum error correction. Our work guides hardware and software design choices for future implementations of scalable quantum-dot architectures. Published by the American Physical Society 2025