Recognition: 1 theorem link
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
-
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 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.
-
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...
-
A Spectral Gap Informed Parameter Schedule for 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.
-
Failure-Guided Fuzzing for Hybrid Quantum-Classical Programs
Failure-guided local fuzzing around non-convergent seeds improves detection of faulty HQC configurations over random testing, with concolic seeding adding workload-dependent benefits on VQE versus QAOA.
-
CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem
Reinforcement learning policy for qubit mapping reduces SWAP overhead by 65-85% versus standard quantum compilers on MQTBench and Queko benchmark circuits.
-
Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.
-
POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles
POETS uses compute-efficient LLM policy ensembles to implicitly perform KL-regularized Thompson sampling, delivering O(sqrt(T gamma_T)) regret bounds and state-of-the-art sample efficiency in scientific discovery task...
-
Ensemble Engineering to Overcome Destructive Cancellation in Quantum Measurements
Quantum ensemble engineering aligns sampling weights with operator sign structures via basis-resolved correlator reformulation and specialized circuits, exposing suppressed contributions in infinite-temperature correl...
-
Quantum Vault: Secure Token Authentication Without Classical State Information Benchmarked on IBMQ
Quantum vault stores token copies at the bank to enable secure authentication without classical side information, achieving false-negative errors below 10^{-4} and attack success below 10^{-18} for 200-token bills on ...
-
Quantum Hypergraph Partitioning
Balanced k-way hypergraph partitioning is cast as QUBO and higher-order binary problems for quantum optimization, with small-instance tests confirming effectiveness for the all-or-nothing cut on 3-uniform hypergraphs.
-
Towards Real-time Control of a CartPole System on a Quantum Computer
A single-qubit quantum reinforcement learning agent solves CartPole faster than classical networks and quantifies shot-count versus control-frequency requirements for real-time closed-loop control on NISQ hardware, in...
-
Conformalized Quantum DeepONet Ensembles for Scalable Operator Learning with Distribution-Free Uncertainty
A quantum ensemble method reduces operator inference to linear complexity and supplies distribution-free uncertainty bounds for high-dimensional dynamical systems.
-
Efficient Mutation Testing of Quantum Machine Learning Models
New mutation operators and directed mutant generation produce more diverse faulty quantum neural network circuits than prior techniques, as shown in experiments.
-
Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization
FinITE gives an exact identity linking LCU success probability to ground-subspace fidelity for diagonal Pauli-Z Hamiltonians, yielding a closed-form imaginary-time threshold beta-star based on spectral gap and initial...
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft achieves fast exact simulation of near-Clifford quantum circuits via dynamic active subspaces, delivering orders-of-magnitude speedups and the first full end-to-end simulations of magic state cultivation over h...
-
Experimental high-dimensional multi-qubit Bell non-locality on a superconducting quantum processor
Experimental observation of high-dimensional Bell nonlocality between two d=64 systems encoded in 12 qubits, with violations exceeding d=2 bounds and evidence that the nonlocality is genuinely collective across all qubits.
-
Improving Zero-Noise Extrapolation via Physically Bounded Models
Physically bounded extrapolation models for zero-noise extrapolation reduce unphysical predictions and improve stability compared to unbounded fits on large synthetic benchmarks and real hardware.
-
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
-
Quantum hardware noise learning via differentiable Kraus representation on tensor networks
A differentiable tensor-network framework learns CPTP noise channels from single-circuit measurement data on IBM hardware and generalizes the model to unrelated circuits.
-
MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework
MonteQ applies Monte Carlo Tree Search in a two-level framework to optimize Pauli rotation orderings for Hamiltonian simulation, cutting CNOT counts by up to 53% versus prior compilers.
-
Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation
Quantum kernel methods show no statistically significant edge over strong classical baselines on tabular classification tasks, with current feature maps failing to match the spectral properties of the best classical kernel.
-
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.
-
A unified framework for efficient quantum simulation of nonlinear spectroscopy
A unified quantum framework computes n-th order nonlinear spectroscopies on near-term devices by reformulating multi-time responses as weighted sums of finite-amplitude expectation values via a generalized parameter s...
-
Orkan: Cache-friendly simulation of quantum operations on hermitian operators
Orkan simulates quantum operations on Hermitian operators using a cache-friendly tiled lower-triangle layout, halving memory and achieving 2-4x speedups over Qiskit Aer, QuEST, and Qulacs.
-
AlphaCNOT: Learning CNOT Minimization with Model-Based Planning
AlphaCNOT combines reinforcement learning with Monte Carlo Tree Search planning to reduce CNOT gate counts by up to 32% versus heuristics in quantum circuit synthesis.
-
Tackling instabilities of quantum Krylov subspace methods: an analysis of the numerical and statistical errors
In noisy quantum settings, Krylov subspace methods are limited by statistical fluctuations rather than ill-conditioning, and new imaginary and unitary filters can validate solutions without reference to the true eigen...
-
When T-Depth Misleads: Predicting Fault-Tolerant Quantum Execution Slowdown under Magic-State Delivery Constraints
Delta_max outperforms T-depth as a predictor of slowdown under magic-state constraints and supplies a tight lower bound on makespan with zero violations across 4,904 test instances.
-
Protein-Ligand Free Energy Perturbation on Quantum Hardware
A QM/MM FEP workflow on quantum hardware with LUCJ-SQD yields binding free energies for thermolysin inhibitors in reasonable agreement with experiment and closer than classical HCI, with comparable run times.
-
SatQNet: Satellite-assisted Quantum Network Entanglement Routing Using Directed Line Graph Neural Networks
SatQNet uses decentralized RL with an edge-centric directed line graph neural network to route entanglements in dynamic satellite-assisted quantum networks, outperforming heuristics and generalizing to unseen topologies.
-
Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling
New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.
-
Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing
Constraint-aware initialization and hybrid XY-X mixer in QAOA for VRP yield lower average energies and higher feasible-solution ratios than standard QAOA across ideal, finite-shot, and noisy simulations.
-
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
Heterogeneous quantum architectures with task-specific hardware and QEC encodings deliver up to 138x lower physical-qubit overhead than monolithic baselines for fault-tolerant algorithms, including RSA-2048 factoring ...
-
QuantumXCT: Learning Interaction-Induced State Transformation in Cell-Cell Communication via Quantum Entanglement and Generative Modeling
QuantumXCT learns parameterized quantum circuits to model interaction-induced unitary transformations between non-interacting and interacting cellular state distributions from transcriptomic profiles.
-
Scalable Measurement-Based Quantum Simulation Patterns for Benchmarking
QPatLib v1.0 releases benchmark measurement patterns for measurement-based quantum simulation of Pauli-string unitaries, with scalable conventions for commuting subsets.
-
QuBridge: Layer-wise Fidelity Decomposition in Quantum Computation Pipeline
QuBridge decomposes quantum pipelines into qubit selection, pulse assignment, and error encoding layers, quantifying their fidelity impacts via ablation on teleportation under IBM noise models.
-
The Quantum Hamiltonian Analysis Toolkit: Lowering the Barrier to Quantum Computing with Hamiltonians
QHAT is a user-friendly software toolkit for Hamiltonian generation, analysis, and fault-tolerant quantum simulation driven by error tolerances rather than algorithmic parameters.
-
Scalable Quantum Reservoir Computing over Distributed Quantum Architectures
Quantum reservoir computing with distributed architectures reduces time-series forecasting errors by up to 78.8% MAE and 72.3% RMSE in NISQ simulations compared to classical methods.
-
ffsim: Faster simulation of fermionic quantum circuits
ffsim is a new open-source library that accelerates fermionic quantum circuit simulation by using particle number and spin symmetries to cut memory and runtime, outperforming FQE on benchmarks up to 64 qubits.
-
Probability Distribution Analysis of the Cascaded Variational Quantum Eigensolver
A trapezoidal preparation method combined with probability distribution analysis is used to pick efficient guiding states for CVQE, demonstrated on the H2 + H2+ to H3+ + H reaction.
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error...
-
Quantum annealing inspired algorithms for the NISQ Era
Approximate quantum annealing supplies effective warm-start parameters for QAOA while EHQO guides optimization through intermediate Hamiltonians, yielding better performance than random initialization on hard 2-SAT pr...
-
A Fully Quantum Algorithm for Image Edge Detection
A fully quantum gradient-based edge detection algorithm using NEQR encoding, cyclic shifts for neighbor superpositions, direction-aware alignment, and a Quantum Partitioning Algorithm for in-place thresholding, with c...
-
Lagrange: Operating Italy's First Publicly-Accessible Quantum Computer for Research and Education
A custom proxy-based middleware layer turns a vendor-delivered 5-qubit quantum processor into Italy's first publicly accessible quantum computer, processing over 240,000 jobs with greater than 98 percent uptime and su...
-
Continuous-time quantum-walk centrality for protein residue interaction networks
Continuous-time quantum walks on protein residue networks yield a centrality measure that agrees with eigenvector centrality, incorporates quantum interference, recovers functional residues, and runs on IBM quantum hardware.
-
On the Representational Limits of Quantum-Inspired 1024-D Document Embeddings: An Experimental Evaluation Framework
Quantum-inspired 1024-D document embeddings exhibit weak, unstable ranking performance and structural geometric limitations, performing better as auxiliary components in hybrid lexical-embedding retrieval systems.
-
Taming GPU Underutilization via Static Partitioning and Fine-grained CPU Offloading
Static MIG partitioning cuts GPU underutilization in scientific workloads but leaves interference and coarse-grained mismatches; a Nvlink-C2C offloading scheme is introduced to bridge those gaps.
-
Quantum Simulation of Collective Neutrino Oscillations using Dicke States
New algorithms based on Dicke states enable qubit-efficient quantum simulations of collective neutrino oscillations with demonstrated performance on classical and quantum hardware.
-
Resource Implications of Different Encodings for Quantum Computational Fluid Dynamics
Amplitude encoding in quantum CFD incurs circuit depths from Shende decomposition and requires an empirical ~n ln n runs for accurate readout, motivating a new encoding proposal for quantum LBM.
-
Hybrid Quantum-HPC Middleware Systems for Adaptive Resource, Workload and Task Management
The authors present Pilot-Quantum, a middleware for adaptive resource management in hybrid quantum-HPC systems, along with execution motifs and a performance modeling toolkit called Q-Dreamer.
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]
Pyzx: Large scale automated diagrammatic reasoning
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]
Practical and efficient quantum circuit synthesis and transpiling with rei nforcement learning,
David Kremer, Victor Villar, Hanhee Paik, Ivan Duran, Ismael Faro, and Juan Cruz-Benito. Practical and effi- cient quantum circuit synthesis and transpiling with re- inforcement learning. arXiv preprint arXiv:2405.13196 , 2024
-
[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]
Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
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.