84 | How Many Shots Does It Take? Rethinking Resource Allocation on Noisy Quantum Computers
This talk presents a noise-aware framework for allocating quantum circuit shots, reducing the execution cost, energy consumption, and estimation error of near-term quantum workloads.
80 | Building Efficient Fault-Tolerant Quantum Circuits: From Resource Optimization to Scalable Compilation
This talk presents techniques for reducing T-gate counts, Clifford gate counts, and compilation costs, together with a scalable framework for efficiently compiling large fault-tolerant quantum circuits.
68 | Bridging Hardware and Software: Optimizing Quantum Compilation and Benchmarking for Scalable Quantum Systems
This lecture discusses how integrated hardware–software co-design can address key challenges in scalable quantum computing.
48 | Quantum Circuit Decomposition and Routing Collaborative Design
Quantum computing lecture from the QuCS series.
43 | A Structured Method for Compilation of QAOA Circuits in Quantum Computing
Zheng (Eddy) Zhang is an Associate Professor at Rutgers University.
38 | Pulse-based Variational Quantum Eigensolver and Pulse-Efficient Transpilation
State-of-the-art noisy digital quantum computers can only execute short-depth quantum circuits.
37 | Elevating Quantum Compiler Performance through Enhanced Awareness in the Compilation Stages
Quantum compiler plays a critical role in practical quantum compilation, particularly in the Noise-Intermediate-Scale-Quantum (NISQ) era.
18 | Enabling Deeper Quantum Compiler Optimization at High Level
A quantum compiler is one essential and critical component in a quantum computing system to deploy and optimize the quantum programs onto the underlying physical quantum hardware platforms.
14 | Compilation for Near-Term Quantum Computing: Gap Analysis and Optimal Solution
The most challenging stage in compilation for near-term quantum computing is qubit mapping, also called layout synthesis, where qubits in quantum programs are mapped to physical qubits.