Quantum computing with Qiskit
Pith reviewed 2026-05-10 19:10 UTC · model grok-4.3
The pith
Qiskit provides a layered architecture for representing, optimizing, and executing quantum circuits to solve condensed matter physics problems via hybrid computations.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The software architecture supports representation and optimization of quantum circuits at various abstraction levels, retargetability to new gates, and quantum-classical computations via dynamic circuits, which together enable an end-to-end workflow for solving a condensed matter physics problem on a quantum computer.
What carries the argument
The multi-abstraction circuit representation and optimization framework that incorporates dynamic circuits for hybrid quantum-classical steps.
If this is right
- Circuit optimizations can be applied at both high-level and low-level representations to improve performance.
- The system can be retargeted to different quantum gate sets without major redesign.
- Dynamic circuits allow classical computations to influence quantum operations during execution.
- The architecture scales to handle problems drawn from condensed matter physics.
Where Pith is reading between the lines
- This design may reduce the effort needed to adapt quantum algorithms across different hardware platforms.
- Support for hybrid steps suggests that quantum research will increasingly rely on tight integration with classical resources.
- Future work could extend the same optimization layers to larger systems that include error mitigation.
Load-bearing premise
The described architecture and workflow features match the actual implementation and behavior of the software without undisclosed version-specific limits.
What would settle it
Implement the condensed matter physics workflow in the software, run it on quantum hardware, and check whether circuit optimizations reduce gate counts as claimed and whether dynamic circuits execute hybrid steps correctly.
read the original abstract
We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software architecture and its core components. We demonstrate an end-to-end workflow for solving a problem in condensed matter physics on a quantum computer that serves to highlight some of Qiskit's capabilities, for example the representation and optimization of circuits at various abstraction levels, its scalability and retargetability to new gates, and the use of quantum-classical computations via dynamic circuits. Lastly, we discuss some of the ecosystem of tools and plugins that extend Qiskit for various tasks, and the future ahead.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript describes Qiskit, an open-source software development kit for quantum information science. It outlines key design decisions, the overall software architecture and core components, then presents an end-to-end workflow that solves a condensed-matter physics problem on a quantum computer. The workflow is used to illustrate circuit representation and optimization across abstraction levels, scalability, retargetability to new gates, and quantum-classical hybrid computation via dynamic circuits. The paper closes with a discussion of the surrounding ecosystem of tools and plugins together with future directions.
Significance. If the narrative accurately reflects the APIs, code paths, and capabilities present at the time of writing, the paper supplies a useful reference document for the quantum-computing community. It documents how a production-grade SDK can be used to move from high-level circuit construction through optimization and execution on hardware, with explicit attention to dynamic circuits and retargetability. Such documentation is valuable for both new users and developers who wish to extend or interface with Qiskit.
minor comments (3)
- The abstract and introduction would benefit from naming the specific condensed-matter model (e.g., Heisenberg chain, Hubbard model) and the observable being computed, so that readers can immediately judge the scope of the demonstration.
- Section describing the workflow should include explicit version numbers or commit hashes of the Qiskit packages used, together with a pointer to a public repository containing the exact scripts, to allow reproducibility of the illustrated circuit transformations.
- Figure captions for the circuit diagrams at different abstraction levels should state the gate set and optimization pass sequence applied in each panel, rather than leaving these details only in the main text.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript and for recommending acceptance. We appreciate the recognition that the paper provides a useful reference for the quantum-computing community by documenting Qiskit's architecture, workflows, and capabilities.
Circularity Check
No significant circularity
full rationale
The paper is a purely descriptive software architecture and demonstration article. Its central claim is the existence of an end-to-end workflow exercising circuit abstraction, optimization, retargetability, scalability, and dynamic-circuit features inside Qiskit. No equations, first-principles derivations, quantitative predictions, or fitted parameters are offered whose validity could reduce to self-referential inputs or self-citations. The claim holds if the narrative accurately reflects the code and APIs at the time of writing; this is an external factual match rather than an internal derivation chain. No steps meet any of the enumerated circularity patterns.
Axiom & Free-Parameter Ledger
Forward citations
Cited by 60 Pith papers
-
Quantum Computations on Fusion Blanket Molten Salts
First heterogeneous quantum-classical computation on FLiBe clusters for tritium binding using EWF partitioning and ext-SQD on IBM hardware matches FCI fragment energies within 0.3 kcal/mol MAD but shows 12-110 kcal/mo...
-
Auditing Empirical Comparisons in Quantum Software
CLAIMSTAB-QC audits 455 comparative claims from 119 quantum-software papers and identifies a materialization gap where only 8 claims provide enough matched evidence for direct auditing, yielding 2 sustained, 4 unresol...
-
BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis
BPBO performs certified local resynthesis on one- to three-wire regions of BFK09 brickwork to reduce pattern size while preserving UBQC blindness, demonstrated on Grover and Toffoli cases with reductions up to 3x725 to 3x98.
-
Quantum Fourier Generative Models Trainable at Large Scale
Quantum Fourier generative models are trained classically at over 1000-qubit scale using log-likelihood loss from Parseval's identity and deployed on superconducting hardware for fast sampling that preserves multi-mod...
-
Quantum Mutant Equivalence via Transpilation
TBE identifies 32.1% of 92,011 equivalent surviving quantum mutants (29,536) via OpenQASM comparison after transpilation, reporting 100% precision and 82% accuracy on 348,299 mutants.
-
Nonequilibrium steady states induced by stochastic mid-circuit measurements and resets on a quantum computer
Hardware demonstration of nonequilibrium steady states via stochastic mid-circuit measurements and resets on a superconducting quantum processor for the interacting Floquet transverse-field Ising model.
-
Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians
Recursive grouping of Pauli terms with anti-commuting sign-flip strings reduces compiled T depth by 85.2% and CX depth by 68.9% on a 24-spin Kagome Hamiltonian versus term-by-term controlled rotations.
-
Penalty-free quantum optimization applied to lattice protein folding
A QAOA variant without quadratic penalties, using independent sets in a conflict graph, is applied to lattice protein folding and validated on proteins up to length 14 via simulation and heuristic search.
-
Koopman--von Neumann Molecular Dynamics for Green--Kubo Transport Coefficients
Green-Kubo transport coefficients are recast as a quantum phase estimation readout problem inside the Koopman-von Neumann representation of classical NVE and NVT dynamics.
-
A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling
A compiler for neutral-atom NISQ devices introduces hub traps and shuttling rules to compile circuits that SWAP-only methods cannot handle in practical time, eliminating SWAP gates and improving a fidelity proxy on ro...
-
Error-corrected phase estimation averaged over variable grids on a trapped-ion quantum computer: hyperacuity spectra of a CO molecule adsorbed onto $\chi$-Fe$_5$C$_2$
QAVG reconstructs sub-resolution excitation spectra of a CO/χ-Fe5C2 model via averaged variable-grid QPE on Quantinuum H2-2 with Steane-code error correction.
-
Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
A new step size rule lets boosted stochastic Frank-Wolfe match ordinary stochastic Frank-Wolfe rates on nonconvex and quasar-convex problems and deliver faster empirical convergence on sparse logistic regression and q...
-
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
-
Beyond Commutativity: Redesigning Trotter Decomposition via Local Symmetry
A local SU(2) symmetry-based product formula clusters Hamiltonian terms into at most four classes for exact two-qubit implementations, cutting commutator errors and gate count in many-body simulations.
-
From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).
-
QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning
QAP-Router models qubit routing as dynamic QAP and applies RL with a solution-aware Transformer to cut CNOT counts by 12-30% versus industry compilers on real circuit benchmarks.
-
TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency
TuniQ uses RL with a dual-encoder, shaped rewards, and action masking to autotune quantum compilation passes, improving fidelity and speed over Qiskit while generalizing across backends and scaling to large circuits.
-
Per-Phase Fidelity Attribution for Quantum Compilers using HBR Decomposition
HBR decomposition quantifies per-phase fidelity loss in quantum compilers, revealing that routing causes up to 60% loss in search circuits while synthesis dominates Hamiltonian simulation, and correctly predicts SDK r...
-
The finite-shot help-harm boundary of zero-noise extrapolation
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition enables a generalized quantum framework for Carleman-linearized polynomial systems like the lattice Boltzmann equation, with Ns scaling as O(α² Q²) independent of spatial and temporal d...
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition yields a quantum framework for Carleman-linearized lattice Boltzmann equations whose term count scales as O(α² Q²) and is independent of spatial or temporal grid points.
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulati...
-
Spectral Gap Informed Ramp QAOA
SGIR-QAOA uses spectral gap information to create non-linear parameter schedules that outperform linear ramps on Grover's problem and MIS, achieving target probabilities at lower depths even under mild noise.
-
Hamiltonian simulation for 3D elastic wave equations in homogeneous elastic media
Explicit first- and second-order Trotter circuits are constructed for the discretized 3D elastic wave equation with derived error bounds and qubit/CNOT complexity estimates in terms of grid size, time, accuracy, and m...
-
QuIC: A Training-Free Quantum Graph Embedding from Ideal Analysis to Practical Hardware Evaluation
QuIC provides a training-free quantum graph embedding proven permutation-invariant and injective for labeled graphs under an irrational-angle condition in the ideal case, with empirical separation shown on noisy hardw...
-
QAFE$^2$: Quantum Accelerated Multiscale Finite Element Analysis
QAFE² uses quantum parallelism to evaluate every RVE problem at all quadrature points simultaneously, delivering polylog complexity in microscopic mesh size and exponential speedup over classical solvers.
-
Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers
Qurator jointly optimizes queue time and fidelity for hybrid quantum-classical workflows across providers using quantum-aware DAG scheduling and a unified logarithmic fidelity score, achieving 30-75% wait reduction at...
-
Hybrid Fourier Neural Operator for Surrogate Modeling of Laser Processing with a Quantum-Circuit Mixer
HQ-LP-FNO replaces part of the spectral channel mixing in a 3D FNO with a mode-shared VQC, reducing parameters by 15.6% and phase-fraction MAE by 26% on laser-processing surrogates while remaining stable under calibra...
-
Characterizing and Benchmarking Dynamic Quantum Circuits
Dynamarq is a new scalable benchmarking framework that defines structural features for dynamic quantum circuits and uses statistical models to predict hardware fidelity with transferable parameters.
-
Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers
Quantum hardware simulation of SU(2) lattice gauge thermalization matches classical extrapolations up to 101 plaquettes after error mitigation, establishing feasibility for chaotic quantum field systems.
-
Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions
A modular block-encoding framework for finite-difference Laplacians supporting arbitrary combinations of Dirichlet, periodic, and Neumann boundary conditions across dimensions.
-
Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems
CSQD improves SQD energy estimates in strongly correlated systems by replacing a global reference occupancy vector with cluster-specific ones, lowering energies by up to 15.95 mHa for stretched N2 and 57.82 mHa for [2Fe-2S].
-
Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks
Holographic isoTNS represent volume-law entangled states including arbitrary fermionic Gaussian states, Clifford states, and certain short-time evolved states using an extra network dimension with isometric constraints.
-
Helios: A 98-qubit trapped-ion quantum computer
Helios achieves 98 qubits with single-qubit gate infidelity 2.5(1)×10^{-5}, two-qubit 7.9(2)×10^{-4}, and SPAM 4.8(6)×10^{-4}, enabling circuits beyond classical simulation.
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedup...
-
Certifying localizable quantum properties with constant sample complexity
A new framework certifies global quantum properties including multipartite entanglement, circuit complexity, and quantum magic on small subsystems with constant sample complexity via local Pauli measurements.
-
Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods
Introduces branch-based and other optimization models for maximum parsimony trees, with classical validation outperforming heuristics on GAPDH data and quantum simulations solving small instances exactly.
-
Identifying Protein Co-regulatory Network Logic by Solving B-SAT Problems through Gate-based Quantum Computing
Grover's algorithm solves a B-SAT encoding of protein co-regulatory logic to recover high-likelihood Boolean models for a 5-protein neural development network from sparse data on quantum simulators and NISQ devices.
-
Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction
Position graph abstraction plus SHAPER/SHAW heuristics enable shuttling-aware compilation on trapped-ion machines, succeeding on extreme cases where baselines fail and yielding 1.45x average (up to 4x) speedups.
-
Explainable quantum neural networks for multi-material topology optimization
XQNN is a quantum neural network trained solely on fixed-mesh 2D multi-material topology optimization histories that generalizes to out-of-distribution loads, refined meshes, and 3D voxel problems without retraining.
-
Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
Pi-QEM selects dominant low-weight Pauli strings for ML training in quantum error mitigation, reducing ground-state energy estimation error by up to 34.01% using a single observable in molecular simulations on noisy I...
-
Perturbatively Corrected Linear Response Selected Configuration Interaction
LR-SCI-PT with second-order Epstein-Nesbet corrections improves static polarizabilities toward FCI limits for small molecules but preserves the parent pole structure, limiting it to static properties.
-
Challenges in Barren Plateau Mitigation with Dynamic Parameterized Quantum Circuits
Dynamic parameterized quantum circuits still leave a significant fraction of parameters untrainable despite cost anti-concentration, implying BP mitigation via DPQCs is at least as hard as designing BP-free unitaries.
-
QVaR: a Quantum Variational Regularization method for Linear Inverse Problems
QVaR formulates Tikhonov and sparsity-regularized inverse problems as QUBO for quantum solvers, introduces quantum sensitivity, and derives bounds linking quantum perturbations to classical ill-posedness.
-
Quantum-Accelerated Self-Consistent Field: A Hybrid Algorithm
GAS-SCF uses Grover adaptive search and quantum arithmetic to mark and amplify improving Fock states, offering a theoretical quadratic speedup for SCF optimization, shown via classical simulations up to 26 qubits and ...
-
All-valid-state HOBO encoding for constrained combinatorial optimization on NISQ devices
Authors introduce AVS-HOBO encoding for TSP that eliminates one penalty term via cyclic mapping and report improved VQE performance in noiseless simulations and hardware runs compared to standard HOBO.
-
Certified Finite-Shot Operating Windows for Virtual Distillation and Symmetry Verification
Proves finite-shot mean-squared-error laws for virtual distillation and symmetry verification that define certified operating windows and a selection trichotomy for their comparison.
-
Simultaneous Estimation of Partial-Transpose Moments with Active Memory Independent of the Moment Order
A qubit-reuse protocol estimates partial-transpose moments p_2 to p_K simultaneously to additive error ε using O(K log K / ε²) copies and at most 2n+1 active qubits independent of K, with matching Ω(K/ε²) lower bounds.
-
Quantum Mechanical Studies of Photodissociation Dynamics on Quantum Computers
Quantum algorithm for photodissociation wavefunction propagation on quantum computers via split-operator, QFT, dilated non-unitary absorber, and Hadamard-test autocorrelation, matching benchmarks on NOCl under ideal c...
-
SCOPE: A Syndrome-Driven Control Plane for QEC-Enabled Quantum Networks
SCOPE harvests QEC syndromes passively to reconstruct network error maps for joint route-and-code optimization, claiming over 60% better error estimation and 30-35% lower logical error rates versus baselines in NetSqu...
-
Quantum circuit partition as a maze: emerging percolation transition via path finding
Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.
-
Machine Learning-based Quantum Error Mitigation for Variational Algorithms
ML-QEM protocol trained on (near-)Clifford circuits achieves several-fold error suppression on VQE for Sherrington-Kirkpatrick Hamiltonian up to 12 qubits and outperforms ZNE in high-noise regimes.
-
Towards Heisenberg Scaling: Measurement-Efficient Non-Orthogonal Quantum Eigensolver
Replaces sampling-based estimation in NOQE with iterative quantum amplitude estimation to achieve O(1/ε) query complexity for Hamiltonian and overlap matrices.
-
Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
-
Accelerating physics-informed neural networks for full waveform inversion using a hybrid quantum-classical finite-basis architecture
Hybrid quantum-classical FBPINN for acoustic FWI achieves lower L1 velocity error than classical baselines in ~8x fewer iterations with ~33% fewer parameters on anomaly and checkerboard benchmarks.
-
Linear Complexity Fermionic Simulation on Quantum Devices with Hardware Connectivity Constraints
Accordion fixes the Jordan-Wigner mapping and co-designs compilation stages to prove O(N^4) gate count and depth for all-to-all electronic Hamiltonians, with up to 79% gate and 77% depth reductions on linear, heavy-he...
-
Shallow Electronic State Preparation for Quantum Chemistry with Quantum Monte Carlo Pre-Selection
QMC pre-selection constructs shallow, number-symmetric Givens rotation circuits for quantum chemistry that outperform deeper ansatze on noisy hardware such as Quantinuum H1.
-
Overcoming the Matrix-Product-State Encoding Barrier via DMRG-Guided Probabilistic Imaginary-Time Evolution
A hybrid DMRG-MPD-PITE framework prepares ground states by limiting MPS encoding depth at the logistic inflection point and using DMRG estimates to schedule PITE, reducing post-selection overhead.
-
Treewidth-Aware Gate Cut Selection for Reducing Transpilation Overhead on Superconducting Quantum Devices
TW2S selects gate cuts via treewidth-aware min-fill scoring followed by betweenness centrality with degree penalty, outperforming random selection on graphs with moderate community structure and yielding lower estimat...
-
A Quantum Algorithm for Simulating Nonunitary Dynamics Governed by Nonautonomous Linear Ordinary Differential Equations
Quantum algorithm that performs SVD-based dilation of nonunitary propagators on quantum hardware for simulating nonautonomous linear ODEs without a priori propagator knowledge.
Reference graph
Works this paper leans on
-
[1]
Computational primitives Beside specifying the quantum circuit, the computa- tion’s output is also a key consideration. In quantum computing there exist two main primitives for captur- ing the output of a quantum circuit: sampling output bitstrings, or estimating observable expectation values. These primitives are the means by which circuits are evaluated...
-
[2]
Qiskit patterns A common flow for using Qiskit is through a four-step workflow, and the software architecture reflects this (see Figure 2). First, a classical problem is mapped to quan- tum computation by generating circuits that encode the problem. This step is best handled by domain-specific software or experts, although Qiskit provides a conve- nient c...
-
[3]
Integrated visualizations A popular feature of Qiskit are its visualization capa- bilities. This includes advanced circuit visualizers that display large circuits of varying characteristics (e.g. see Figure 3), target visualizer for giving an overview of the hardware topology and supported gates, and state and distribution visualizers for understanding co...
-
[4]
Tensor ordering convention When interpreting circuits, a convention must be picked for the ordering of qubits in a register, arguments of all instructions, and of instructions themselves. For example it is common that instructions in a circuit are ordered from left to right (i.e. temporal ordering), which is the opposite of how gate matrices are multiplie...
-
[5]
URL https: //qiskit.github.io/qiskit/
Airspeed velocity of an unladen Qiskit. URL https: //qiskit.github.io/qiskit/
-
[6]
URL https://github.com/ Qiskit/qiskit/graphs/contributors
Qiskit contributors. URL https://github.com/ Qiskit/qiskit/graphs/contributors
-
[7]
URL https://github.com/Qiskit/ qiskit
Qiskit on Github. URL https://github.com/Qiskit/ qiskit
-
[8]
URL https://pypi.org/project/qiskit/
Qiskit on the Python Package Index (PyPI). URL https://pypi.org/project/qiskit/
-
[9]
URL https://github.com/ qiskit-community/qiskit-cold-atom
Qiskit Cold Atom, . URL https://github.com/ qiskit-community/qiskit-cold-atom
-
[10]
URL https://github.com/ Qiskit/qiskit-ibm-runtime
Qiskit IBM Runtime, . URL https://github.com/ Qiskit/qiskit-ibm-runtime
-
[11]
URL https://github.com/Qiskit/ qiskit-ionq
Qiskit IonQ, . URL https://github.com/Qiskit/ qiskit-ionq
-
[12]
URL https://github.com/Qiskit/ qiskit-rigetti
Qiskit Rigetti, . URL https://github.com/Qiskit/ qiskit-rigetti
- [13]
-
[14]
URL https://unitary.fund/posts/2023_ survey_results
The State of quantum open source software 2023: sur- vey results. URL https://unitary.fund/posts/2023_ survey_results
work page 2023
- [15]
-
[16]
Circuit Knitting Toolbox, 2024. URL https://github. com/Qiskit-Extensions/circuit-knitting-toolbox
work page 2024
-
[17]
Qiskit SAT Synthesis, 2024. URL https://github. com/qiskit-community/qiskit-sat-synthesis
work page 2024
-
[18]
Improved sim- ulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman. Improved sim- ulation of stabilizer circuits. Physical Review A , 70(5): 052328, 2004
work page 2004
-
[19]
Qiskit pulse: pro- gramming quantum computers through the cloud with pulses
Thomas Alexander, Naoki Kanazawa, Daniel J Egger, Lauren Capelluto, Christopher J Wood, Ali Javadi- Abhari, and David C McKay. Qiskit pulse: pro- gramming quantum computers through the cloud with pulses. Quantum Science and Technology , 5(4):044006, 2020
work page 2020
-
[20]
Yuri Alexeev, Maximilian Amsler, Marco Antonio Bar- roca, Sanzio Bassini, Torey Battelle, Daan Camps, David Casanova, Young jai Choi, Frederic T Chong, Charles Chung, et al. Quantum-centric supercomputing for materials science: A perspective on challenges and future directions. Future Generation Computer Systems, 2024
work page 2024
-
[21]
Amazon Web Services. Amazon Braket, 2020. URL https://aws.amazon.com/braket/
work page 2020
-
[22]
Amazon Web Services. AutoQASM, 2024. URL https://github.com/amazon-braket/ amazon-braket-sdk-python/tree/feature/ autoqasm/src/braket/experimental/autoqasm. 13
work page 2024
-
[23]
staq—a full-stack quantum processing toolkit
Matthew Amy and Vlad Gheorghiu. staq—a full-stack quantum processing toolkit. Quantum Science and Technology, 5(3):034016, 2020. URL https://github. com/softwareQinc/staq
work page 2020
-
[24]
Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning
Matthew Amy, Dmitri Maslov, and Michele Mosca. Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(10):1476–1489, 2014
work page 2014
-
[25]
Elisa B¨ aumer, Vinay Tripathi, Derek S. Wang, Patrick Rall, Edward H. Chen, Swarnadeep Ma- jumdar, Alireza Seif, and Zlatko K Minev. Effi- cient Long-Range Entanglement using Dynamic Cir- cuits. arXiv preprint arXiv:2308.13065 , 2023. doi: 10.48550/arXiv.2308.13065
-
[26]
Purification of noisy entanglement and faith- ful teleportation via noisy channels
Charles H Bennett, Gilles Brassard, Sandu Popescu, Benjamin Schumacher, John A Smolin, and William K Wootters. Purification of noisy entanglement and faith- ful teleportation via noisy channels. Physical review let- ters, 76(5):722, 1996
work page 1996
-
[27]
Mixed-state entan- glement and quantum error correction
Charles H Bennett, David P DiVincenzo, John A Smolin, and William K Wootters. Mixed-state entan- glement and quantum error correction. Physical Review A, 54(5):3824, 1996
work page 1996
-
[28]
PennyLane: Automatic differentiation of hybrid quantum-classical computations
Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin, Shahnawaz Ahmed, Vishnu Ajith, M Sohaib Alam, Guillermo Alonso-Linaje, B AkashNarayanan, Ali Asadi, et al. Pennylane: Automatic differentiation of hybrid quantum-classical computations. arXiv preprint arXiv:1811.04968, 2018. URL https://github.com/ PennyLaneAI/pennylane
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[29]
Assessing requirements to scale to practical quantum advantage
Michael E Beverland, Prakash Murali, Matthias Troyer, Krysta M Svore, Torsten Hoefler, Vadym Kliuchnikov, Guang Hao Low, Mathias Soeken, Aarthi Sundaram, and Alexander Vaschillo. Assessing requirements to scale to practical quantum advantage. arXiv preprint arXiv:2211.07629, 2022
work page internal anchor Pith review arXiv 2022
-
[30]
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal Clifford gates and noisy ancillas. Physical Review A , 71(2):022316, 2005
work page 2005
-
[31]
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert Koenig, and Marco Tomamichel. Quantum advantage with noisy shallow circuits. Nature Physics , 16(10):1040–1045, 2020
work page 2020
-
[32]
Superstaq: Deep optimization of quantum programs
Colin Campbell, Frederic T Chong, Denny Dahl, Paige Frederick, Palash Goiporia, Pranav Gokhale, Benjamin Hall, Salahedeen Issa, Eric Jones, Stephanie Lee, et al. Superstaq: Deep optimization of quantum programs. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) , volume 1, pages 1020–1032. IEEE, 2023. URL https://github.com/...
work page 2023
-
[33]
Variational quantum algorithms
Marco Cerezo, Andrew Arrasmith, Ryan Babbush, Si- mon C Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, et al. Variational quantum algorithms. Nature Reviews Physics, 3(9):625–644, 2021
work page 2021
-
[34]
Edward H. Chen, Guo-Yi Zhu, Ruben Verresen, Alireza Seif, Elisa B¨ aumer, David Layden, Nathanan Tan- tivasadakarn, Guanyu Zhu, Sarah Sheldon, Ashvin Vishwanath, Simon Trebst, and Abhinav Kan- dala. Realizing the Nishimori transition across the error threshold for constant-depth quantum cir- cuits. arXiv preprint arXiv:2309.02863 , 2023. doi: 10.48550/arX...
-
[35]
OpenQASM 3: A broader and deeper quan- tum assembly language
Andrew Cross, Ali Javadi-Abhari, Thomas Alexander, Niel De Beaudrap, Lev S Bishop, Steven Heidel, Colm A Ryan, Prasahnt Sivarajah, John Smolin, Jay M Gam- betta, et al. OpenQASM 3: A broader and deeper quan- tum assembly language. ACM Transactions on Quan- tum Computing , 3(3):1–50, 2022
work page 2022
-
[36]
VarSaw: Application-tailored mea- surement error mitigation for variational quantum al- gorithms
Siddharth Dangwal, Gokul Subramanian Ravi, Poulami Das, Kaitlin N Smith, Jonathan Mark Baker, and Frederic T Chong. VarSaw: Application-tailored mea- surement error mitigation for variational quantum al- gorithms. In Proceedings of the 28th ACM Interna- tional Conference on Architectural Support for Pro- gramming Languages and Operating Systems, Volume 4,...
work page 2023
-
[37]
Cirq Developers. Cirq, July 2023. URL https:// github.com/quantumlib/Cirq
work page 2023
-
[38]
The Qiskit Nature developers and contributors. Qiskit nature, April 2023. URL https://doi.org/10.5281/ zenodo.8161252
work page 2023
-
[40]
Pulse-efficient circuit transpilation for quantum applica- tions on cross-resonance-based hardware
Nathan Earnest, Caroline Tornow, and Daniel J Egger. Pulse-efficient circuit transpilation for quantum applica- tions on cross-resonance-based hardware. Physical Re- view Research, 3(4):043088, 2021
work page 2021
-
[41]
The randomized measurement toolbox
Andreas Elben, Steven T Flammia, Hsin-Yuan Huang, Richard Kueng, John Preskill, Benoˆ ıt Vermersch, and Peter Zoller. The randomized measurement toolbox. Nature Reviews Physics , 5(1):9–24, 2023
work page 2023
-
[42]
Middleware for quantum: An or- chestration of hybrid quantum-classical systems
Ismael Faro, Iskandar Sitdikov, David Garcia Vali˜ nas, Francisco Jose Martin Fernandez, Christopher Codella, and Jennifer Glick. Middleware for quantum: An or- chestration of hybrid quantum-classical systems. In 2023 IEEE International Conference on Quantum Soft- ware (QSW), pages 1–8. IEEE, 2023
work page 2023
-
[43]
Roland C Farrell, Marc Illa, Anthony N Ciavarella, and Martin J Savage. Scalable circuits for preparing ground states on digital quantum computers: The schwinger model vacuum on 100 qubits. PRX Quantum, 5:020315, Apr 2024. doi:10.1103/PRXQuantum.5.020315. URL http://dx.doi.org/10.1103/PRXQuantum.5.020315
-
[44]
Roland C Farrell, Marc Illa, Anthony N Ciavarella, and Martin J Savage. Quantum Simulations of Hadron Dynamics in the Schwinger Model using 112 Qubits. arXiv preprint arXiv:2401.08044 , 2024. doi: 10.48550/arXiv.2401.08044
-
[45]
Quipper: a scalable quantum programming language
Alexander S Green, Peter LeFanu Lumsdaine, Neil J Ross, Peter Selinger, and Benoˆ ıt Valiron. Quipper: a scalable quantum programming language. In Proceed- ings of the 34th ACM SIGPLAN conference on Pro- gramming language design and implementation , pages 333–342, 2013. URL https://www.mathstat.dal.ca/ ~selinger/quipper/
work page 2013
-
[46]
Encoding a magic state with beyond break-even fidelity
Riddhi S Gupta, Neereja Sundaresan, Thomas Alexan- der, Christopher J Wood, Seth T Merkel, Michael B Healy, Marius Hillenbrand, Tomas Jochym-O’Connor, James R Wootton, Theodore J Yoder, Andrew W Cross, Maika Takita, and Benjamin J Brown. Encoding a magic state with beyond break-even fidelity. arXiv preprint arXiv:2305.13581, 2023. 14
-
[47]
Efficient techniques to gpu accelera- tions of multi-shot quantum computing simulations,
Hiroshi Horii, Christopher Wood, et al. Efficient tech- niques to gpu accelerations of multi-shot quantum com- puting simulations. arXiv preprint arXiv:2308.03399 , 2023
-
[48]
CaQR: A compiler-assisted approach for qubit reuse through dynamic circuit
Fei Hua, Yuwei Jin, Yanhao Chen, Suhas Vittal, Kevin Krsulich, Lev S Bishop, John Lapeyre, Ali Javadi- Abhari, and Eddy Z Zhang. CaQR: A compiler-assisted approach for qubit reuse through dynamic circuit. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 , pages 59–71...
work page 2023
-
[49]
Qasmtrans: A qasm based quantum transpiler framework for nisq devices
Fei Hua, Meng Wang, Gushu Li, Bo Peng, Chenxu Liu, Muqing Zheng, Samuel Stein, Yufei Ding, Eddy Z Zhang, Travis S Humble, et al. Qasmtrans: A qasm based quantum transpiler framework for nisq devices. arXiv preprint arXiv:2308.07581 , 2023. URL https: //github.com/pnnl/qasmtrans
-
[50]
Predicting many properties of a quantum system from very few measurements
Hsin-Yuan Huang, Richard Kueng, and John Preskill. Predicting many properties of a quantum system from very few measurements. Nature Physics , 16(10):1050– 1057, 2020
work page 2020
-
[51]
Exact and practical pat- tern matching for quantum circuit optimization
Raban Iten, Romain Moyard, Tony Metger, David Sut- ter, and Stefan Woerner. Exact and practical pat- tern matching for quantum circuit optimization. ACM Transactions on Quantum Computing , 3(1):1–41, 2022
work page 2022
-
[52]
Scaffcc: Scalable compilation and analysis of quantum programs
Ali Javadi-Abhari, Shruti Patil, Daniel Kudrow, Jeff Heckey, Alexey Lvov, Frederic T Chong, and Margaret Martonosi. Scaffcc: Scalable compilation and analysis of quantum programs. Parallel Computing , 45:2–17, 2015. URL https://github.com/epiqc/ScaffCC
work page 2015
-
[53]
Qiskit experiments: A python package to characterize and calibrate quantum comput- ers
Naoki Kanazawa, Daniel J Egger, Yael Ben-Haim, He- lena Zhang, William E Shanks, Gadi Aleksandrowicz, and Christopher J Wood. Qiskit experiments: A python package to characterize and calibrate quantum comput- ers. Journal of Open Source Software , 8(84):5329, 2023
work page 2023
-
[54]
Qiskit as a sim- ulation platform for measurement-based quantum com- putation
Muhammad Kashif and Saif Al-Kuwari. Qiskit as a sim- ulation platform for measurement-based quantum com- putation. In 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C) , pages 152–159. IEEE, 2022
work page 2022
-
[55]
Evidence for the utility of quantum computing before fault tolerance
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout Van Den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala. Evidence for the utility of quantum computing before fault tolerance. Nature, 618(7965):500–505, 2023
work page 2023
-
[56]
arXiv preprint arXiv:1904.04735 (2019)
Aleks Kissinger and John van de Wetering. Pyzx: Large scale automated diagrammatic reasoning. arXiv preprint arXiv:1904.04735 , 2019. URL https:// github.com/Quantomatic/pyzx/tree/master
-
[57]
Quantum measurements and the Abelian Stabilizer Problem
A Yu Kitaev. Quantum measurements and the abelian stabilizer problem. arXiv preprint quant-ph/9511026 , 1995
work page internal anchor Pith review arXiv 1995
- [58]
-
[59]
2QAN: A quantum compiler for 2-local qubit hamiltonian simulation algo- rithms
Lingling Lao and Dan E Browne. 2QAN: A quantum compiler for 2-local qubit hamiltonian simulation algo- rithms. In Proceedings of the 49th Annual International Symposium on Computer Architecture , pages 351–365,
-
[60]
URL https://github.com/lllingoo/2QAN
-
[61]
Llvm: A compila- tion framework for lifelong program analysis & trans- formation
Chris Lattner and Vikram Adve. Llvm: A compila- tion framework for lifelong program analysis & trans- formation. In International symposium on code genera- tion and optimization, 2004. CGO 2004. , pages 75–86. IEEE, 2004
work page 2004
-
[62]
Andrew Litteken, Lennart Maximilian Seifert, Jason Chadwick, Natalia Nottingham, Frederic T Chong, and Jonathan M Baker. Qompress: Efficient compilation for ququarts exploiting partial and mixed radix opera- tions for communication reduction. In Proceedings of the 28th ACM International Conference on Architec- tural Support for Programming Languages and O...
work page 2023
-
[63]
Seth Lloyd. Universal quantum simulators. Science, 273 (5278):1073–1078, 1996
work page 1996
-
[64]
Ritajit Majumdar, Pedro Rivero, Friederike Metz, Areeq Hasan, and Derek S. Wang. Best practices for quantum error mitigation with digital zero-noise extrap- olation. arXiv preprint arXiv:2307.05203 , 2023. doi: 10.48550/arXiv.2307.05203
-
[65]
A doubly stochas- tic matrices-based approach to optimal qubit routing
Nicola Mariella and Sergiy Zhuk. A doubly stochas- tic matrices-based approach to optimal qubit routing. Quantum Information Processing, 22(7):264, 2023. URL https://github.com/qiskit-community/dsm-swap
work page 2023
-
[66]
Nicholas D. Matsakis and Felix S. Klock. The Rust language. In Proceedings of the 2014 ACM SIGAda An- nual Conference on High Integrity Language Technol- ogy, HILT ’14, pages 103–104, New York, NY, USA,
work page 2014
-
[67]
Association for Computing Machinery. ISBN 9781450332170. doi:10.1145/2663171.2663188. URL https://doi.org/10.1145/2663171.2663188
-
[68]
OpenFermion: the electronic structure package for quantum computers
Jarrod R McClean, Nicholas C Rubin, Kevin J Sung, Ian D Kivlichan, Xavier Bonet-Monroig, Yudong Cao, Chengyu Dai, E Schuyler Fried, Craig Gidney, Brendan Gimby, et al. OpenFermion: the electronic structure package for quantum computers. Quantum Science and Technology, 5(3):034014, 2020
work page 2020
-
[69]
MIRAGE: Quantum circuit decomposition and routing collaborative design using mirror gates
Evan McKinney, Michael Hatridge, and Alex K Jones. MIRAGE: Quantum circuit decomposition and routing collaborative design using mirror gates. arXiv preprint arXiv:2308.03874, 2023. URL https://github.com/ Pitt-JonesLab/mirror-gates
-
[70]
Alexander Miessen, Daniel J Egger, Ivano Tav- erneilli, and Guglielmo Mazzola. Benchmarking dig- ital quantum simulations and optimization above hundreds of qubits using quantum critical dynam- ics. arXiv preprint arXiv:2404.08053 , 2024. doi: 10.48550/arXiv.2404.08053
-
[71]
J. A. Montanez-Barrera and Kristel Michielsen. To- wards a universal QAOA protocol: Evidence of quan- tum advantage in solving combinatorial optimization problems. arXiv preprint arXiv:2405.09169 , 2024. doi: 10.48550/arXiv.2405.09169
-
[72]
Pranav S Mundada, Aaron Barbosa, Smarak Maity, Yu- lun Wang, Thomas Merkh, TM Stace, Felicity Nielson, Andre RR Carvalho, Michael Hush, Michael J Biercuk, et al. Experimental benchmarking of an automated de- terministic error-suppression workflow for quantum al- gorithms. Physical Review Applied , 20(2):024034, 2023
work page 2023
-
[73]
Noise- adaptive compiler mappings for noisy intermediate-scale quantum computers
Prakash Murali, Jonathan M Baker, Ali Javadi-Abhari, Frederic T Chong, and Margaret Martonosi. Noise- adaptive compiler mappings for noisy intermediate-scale quantum computers. In Proceedings of the twenty- fourth international conference on architectural support 15 for programming languages and operating systems, pages 1015–1029, 2019
work page 2019
-
[74]
Software mitigation of crosstalk on noisy intermediate-scale quantum computers
Prakash Murali, David C McKay, Margaret Martonosi, and Ali Javadi-Abhari. Software mitigation of crosstalk on noisy intermediate-scale quantum computers. InPro- ceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems , pages 1001–1016, 2020
work page 2020
-
[75]
Optimal qubit assignment and rout- ing via integer programming
Giacomo Nannicini, Lev S Bishop, Oktay G¨ unl¨ uk, and Petar Jurcevic. Optimal qubit assignment and rout- ing via integer programming. ACM Transactions on Quantum Computing , 4(1):1–31, 2022. URL https:// github.com/qiskit-community/qiskit-bip-mapper
work page 2022
-
[76]
Quantum com- putation and quantum information
Michael A Nielsen and Isaac L Chuang. Quantum com- putation and quantum information. Phys. Today, 54(2): 60, 2001
work page 2001
-
[77]
Op- timal synthesis of linear reversible circuits
Ketan N Patel, Igor L Markov, and John P Hayes. Op- timal synthesis of linear reversible circuits. Quantum Inf. Comput. , 8(3):282–294, 2008
work page 2008
-
[78]
Elijah Pelofske, Andreas B¨ artschi, Lukasz Cincio, John Golden, and Stephan Eidenbenz. Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs. arXiv preprint arXiv:2312.00997 ,
-
[79]
doi:10.48550/arXiv.2312.00997
-
[80]
Quantum circuit compilation and hybrid computation using Pauli-based computation
Filipa CR Peres and Ernesto F Galv˜ ao. Quantum circuit compilation and hybrid computation using Pauli-based computation. Quantum, 7:1126, 2023
work page 2023
-
[81]
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Al´ an Aspuru-Guzik, and Jeremy L O’brien. A variational eigenvalue solver on a photonic quantum processor. Na- ture communications, 5(1):4213, 2014
work page 2014
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.