Resource-Efficient Quantum Computing by Breaking Abstractions
Not on the map. Why?
Abstract (arXiv)
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applications that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum Instruction Set Architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2023qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilationcited by 5
- 2022Differentiable Analog Quantum Computing for Optimization and Controlcited by 4
- 2023Training Quantum Boltzmann Machines with Coresetscited by 0
- 2026AutoQuREO: A Framework for Automated Quantum Resource Estimation and Optimizationcited by 0
- 2026AutoQuREO: A Framework for Automated Quantum Resource Estimation and Optimization13 Aug 2026
- 2023qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation1 Aug 2023
- 2023Training Quantum Boltzmann Machines with Coresets26 Jul 2023
- 2022Differentiable Analog Quantum Computing for Optimization and Control28 Oct 2022