Noisy intermediate-scale quantum algorithms
A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …
integer factorization and unstructured database search requires millions of qubits with low …
Computer-inspired quantum experiments
The design of new devices and experiments has historically relied on the intuition of human
experts. Now, design inspirations from computers are increasingly augmenting the capability …
experts. Now, design inspirations from computers are increasingly augmenting the capability …
Software mitigation of crosstalk on noisy intermediate-scale quantum computers
Crosstalk is a major source of noise in Noisy Intermediate-Scale Quantum (NISQ) systems
and is a fundamental challenge for hardware design. When multiple instructions are …
and is a fundamental challenge for hardware design. When multiple instructions are …
Optimal layout synthesis for quantum computing
B Tan, J Cong - Proceedings of the 39th International Conference on …, 2020 - dl.acm.org
Recent years have witnessed the fast development of quantum computing. Researchers
around the world are eager to run larger and larger quantum algorithms that promise …
around the world are eager to run larger and larger quantum algorithms that promise …
MQT Bench: Benchmarking software and design automation tools for quantum computing
Quantum software tools for a wide variety of design tasks on and across different levels of
abstraction are crucial in order to eventually realize useful quantum applications. This …
abstraction are crucial in order to eventually realize useful quantum applications. This …
Atomique: A quantum compiler for reconfigurable neutral atom arrays
The neutral atom array has gained prominence in quantum computing for its scalability and
operation fidelity. Previous works focus on fixed atom arrays (FAAs) that require extensive …
operation fidelity. Previous works focus on fixed atom arrays (FAAs) that require extensive …
Optimization of quantum circuit map** using gate transformation and commutation
This paper addresses quantum circuit map** for Noisy Intermediate-Scale Quantum
(NISQ) computers. Since NISQ computers constrain two-qubit operations to limited …
(NISQ) computers. Since NISQ computers constrain two-qubit operations to limited …
Circuit compilation methodologies for quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is a promising quantum-classical
hybrid algorithm to solve hard combinatorial optimization problems. The multi-qubit …
hybrid algorithm to solve hard combinatorial optimization problems. The multi-qubit …
Q-pilot: Field programmable qubit array compilation with flying ancillas
Neutral atom arrays, particularly the reconfigurable field programmable qubit arrays (FPQA)
with atom movement, show strong promise for quantum computing. FPQA has a dynamic …
with atom movement, show strong promise for quantum computing. FPQA has a dynamic …
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 …
circuits to reduce their CNOT gate count. Our approach employs circuit partitioning for …