Pith. sign in

REVIEW 3 minor 343 cited by

Quantum computing with Qiskit

T0 review · 0 major / 3 minor · reviewed 2026-05-10 · grok-4.3

Pith's one-line read Qiskit provides a layered architecture for representing, optimizing, and executing quantum circuits to solve condensed matter physics problems via hybrid computations.

desk verdict This is a documentation paper on the Qiskit platform with an illustrative workflow, not a research result. read the letter →

arxiv 2405.08810 v3 pith:YUARJKYZ submitted 2024-05-14 quant-ph cs.ET

classification quant-phcs.ET
keywords quantumcomputingsoftwaredevelopmentkitcircuitscircuitoptimizationdynamiccondensedmatterphysicshybridquantum-classical
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper describes the design decisions and architecture of a software development kit for quantum information science. It presents core components that handle circuit representation and optimization at multiple levels of abstraction. An end-to-end workflow applies these tools to a condensed matter physics problem on quantum hardware. This workflow demonstrates scalability, the ability to target new gate sets, and support for dynamic circuits that combine quantum operations with classical computations. The paper also outlines an ecosystem of extensions and future directions for the toolkit.

What carries the argument

The multi-abstraction circuit representation and optimization framework that incorporates dynamic circuits for hybrid quantum-classical steps.

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.

Watch

Extended reading notes

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.

Load-bearing premise

The described architecture and workflow features match the actual implementation and behavior of the software without undisclosed version-specific limits.

Editorial extensions

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.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • 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.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

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)
  1. 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.
  2. 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.
  3. 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

0 responses · 0 unresolved

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

0 steps flagged · score 0.0 of 10

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.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

This paper is a software description with no mathematical derivations, fitted parameters, background axioms, or new postulated entities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum computing with Qiskit." pith.science (2026). https://pith.science/paper/YUARJKYZ

@misc{pith2026240508810,
  author       = {Pith},
  title        = {Pith review of: Quantum computing with Qiskit},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YUARJKYZ}},
  note         = {Machine review of arXiv:2405.08810}
}
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Showing 60 of 343 Pith papers that cite this

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. See all 343 Pith citations

  1. Quantum Computations on Fusion Blanket Molten Salts

    quant-ph 2026-06 unverdicted novelty 8.0 of 10

    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...

  2. Separate and efficient characterization of state-preparation and measurement errors using single-qubit operations

    quant-ph 2025-09 unverdicted novelty 8.0 of 10

    A protocol for separate, efficient characterization of state-preparation and measurement errors via single-qubit operations with depth independent of system size.

  3. Fast logical operations in quantum LDPC codes using simple resource states

    quant-ph 2026-07 conditional novelty 7.0 of 10

    A scheduler-code protocol jointly measures up to 20 commuting logical operators in quantum LDPC codes with ~1.7 cat states per operator, yielding up to 3x faster logical measurements and up to 74x faster Clifford circ...

  4. SQGen: Structured Quantum Image Generation with Latent-Modulated Quantized Tensor Trains

    quant-ph 2026-07 unverdicted novelty 7.0 of 10

    SQGen maps a quantized tensor-train image model with latent-modulated re-uploading rotations onto a shallow native quantum circuit that generates images without a classical decoder.

  5. Decision Kernels for Quantum Error Mitigation: Why Accuracy Gains Need Not Improve Downstream Decisions

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Expectation-value accuracy is not decision-complete for shift-invariant QEM workflows; residual gap geometry (the decision kernel) governs argmin/ranking risk and can invert MSE rankings.

  6. Auditing Empirical Comparisons in Quantum Software

    cs.SE 2026-07 unverdicted novelty 7.0 of 10

    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...

  7. BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    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.

  8. Quantum Fourier Generative Models Trainable at Large Scale

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    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...

  9. Quantum Mutant Equivalence via Transpilation

    cs.SE 2026-06 unverdicted novelty 7.0 of 10

    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.

  10. Nonequilibrium steady states induced by stochastic mid-circuit measurements and resets on a quantum computer

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    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.

  11. Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    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.

  12. Penalty-free quantum optimization applied to lattice protein folding

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    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.

  13. Koopman--von Neumann Molecular Dynamics for Green--Kubo Transport Coefficients

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  14. A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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...

  15. 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$

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  16. Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization

    math.OC 2026-05 unverdicted novelty 7.0 of 10

    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...

  17. A Compilation Framework for Quantum Simulation of Non-unitary Dynamics

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  18. Beyond Commutativity: Redesigning Trotter Decomposition via Local Symmetry

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  19. From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).

  20. QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  21. TuniQ: Autotuning Compilation Passes for Quantum Workloads at Scale for Effectiveness and Efficiency

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  22. Per-Phase Fidelity Attribution for Quantum Compilers using HBR Decomposition

    cs.ET 2026-05 unverdicted novelty 7.0 of 10

    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...

  23. The finite-shot help-harm boundary of zero-noise extrapolation

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    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.

  24. Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    Presents LCNU-plus-embedding data loading for any polynomial Carleman-linearized autonomous system and applies it to the 3D LBE, yielding Ns ~ O(α²Q²) terms and explicit T-gate resource estimates for two solvers.

  25. Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    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...

  26. QAFE$^2$: Quantum accelerated multiscale finite element analysis

    math.NA 2026-04 unverdicted novelty 7.0 of 10

    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.

  27. Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    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...

  28. Hybrid Fourier Neural Operator for Surrogate Modeling of Laser Processing with a Quantum-Circuit Mixer

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    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...

  29. Characterizing and Benchmarking Dynamic Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    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.

  30. Local Thermalization of SU(2) Lattice Gauge Fields on Quantum Computers

    hep-lat 2026-03 unverdicted novelty 7.0 of 10

    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.

  31. Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    A modular block-encoding framework for finite-difference Laplacians supporting arbitrary combinations of Dirichlet, periodic, and Neumann boundary conditions across dimensions.

  32. Cluster-Adaptive Sample-Based Quantum Diagonalization for Strongly Correlated Systems

    quant-ph 2026-03 unverdicted novelty 7.0 of 10

    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].

  33. Detecting Flakiness in Quantum Software: A Dynamic Testing Approach

    cs.SE 2025-12 conditional novelty 7.0 of 10

    Across 23 Qiskit Terra releases, 290 tests were flaky in 10,000 runs each; most fail rarely (about 1e-4 to 1e-3), so typical CI rerun budgets miss them.

  34. Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks

    quant-ph 2025-12 unverdicted novelty 7.0 of 10

    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.

  35. Excited state preparation on a quantum computer through adiabatic light-matter coupling

    quant-ph 2025-11 unverdicted novelty 7.0 of 10

    EXASP prepares the lowest bright excited state of a fermionic Hamiltonian by adiabatically evolving a ground-state-plus-photon system, demonstrated on Hubbard chains, methylene, and a two-qubit IBM chip.

  36. Helios: A 98-qubit trapped-ion quantum computer

    quant-ph 2025-11 accept novelty 7.0 of 10

    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.

  37. Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra

    cs.PL 2025-11 unverdicted novelty 7.0 of 10

    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...

  38. Certifying localizable quantum properties with constant sample complexity

    quant-ph 2025-09 unverdicted novelty 7.0 of 10

    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.

  39. Real-time adaptive quantum error correction by model-free multi-agent learning

    quant-ph 2025-09 conditional novelty 7.0 of 10

    Adaptive quantum error correction: multi-agent RL discovers QEC circuits offline; a bandit-controlled variational layer retrains online, cutting logical infidelity about 18x (qubit) and 3x (qutrit) under drifting bit/...

  40. Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface Codes

    quant-ph 2025-08 conditional novelty 7.0 of 10

    From per-patch binary activity traces of surface-code lattice surgery, TraceQ reconstructs the two-qubit gate dependency DAG and detects embedded subroutines with 74-95% success and no false positives, but only on syn...

  41. Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit

    quant-ph 2025-08 unverdicted novelty 7.0 of 10

    A tunable parallel amplitude estimation algorithm achieves near-Heisenberg query scaling and logarithmic depth via GHZ states and quantum signal processing, with a near-optimality proof using the parallel quantum adve...

  42. Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods

    quant-ph 2025-08 unverdicted novelty 7.0 of 10

    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.

  43. Optimized Qubit Routing for Commuting Gates via Integer Programming

    math.OC 2025-07 conditional novelty 7.0 of 10

    A new exact integer-programming formulation, the Token Meeting Problem, provably minimizes swap gates when routing commuting-gate quantum circuits, with NP-hardness and asymptotic bounds.

  44. Mitigating errors in state preparation and measurement with noncomputational states

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Using extra transmon levels to measure state-preparation error lets a noise-learning protocol separate state-preparation, gate, and measurement errors, including for mid-circuit measurements.

  45. Accelerated spin-adapted ground state preparation with non-variational quantum algorithms

    quant-ph 2025-06 conditional novelty 7.0 of 10

    A two-step penalty and post-processing scheme cuts the gate complexity of non-variational spin-adapted ground state preparation from quartic to quadratic scaling for spin-rotationally symmetric Hamiltonians.

  46. Identifying Protein Co-regulatory Network Logic by Solving B-SAT Problems through Gate-based Quantum Computing

    quant-ph 2025-04 unverdicted novelty 7.0 of 10

    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.

  47. Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction

    quant-ph 2025-01 unverdicted novelty 7.0 of 10

    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.

  48. Laws of Quantum Programming

    cs.PL 2024-12 conditional novelty 7.0 of 10

    A formally verified collection of algebraic laws, normal forms, and a tail-recursion theorem for quantum programs, generalizing Hoare's classical laws.

  49. Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements

    quant-ph 2024-12 conditional novelty 7.0 of 10

    Coherent errors plus syndrome measurement on a surface code create emergent unitary designs on the logical qubit above a finite threshold that also marks the optimal error-correction and entanglement transitions.

  50. From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware

    quant-ph 2026-07 conditional novelty 6.5 of 10

    Across 247 hardware runs, an empirical fidelity proxy near 0.1 (~770 two-qubit gates) marks noise-dominated execution for packing and independent-set problems, while QAP is structurally infeasible and compiled QAOA mo...

  51. Code-space recovery for sample-based quantum diagonalization beyond native symmetry constraints

    quant-ph 2026-07 conditional novelty 6.5 of 10

    Engineered dual-rail code-space recovery extends SQD to symmetry-free Hamiltonians and yields lower Ritz energies than unencoded sample support on Ising models up to 36 sites.

  52. A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer

    quant-ph 2026-07 conditional novelty 6.5 of 10

    LCNU loading plus multigrid-warmed VQLS solves Carleman-linearized 1D Burgers on quantum hardware/simulators, with circuits scaling to 2^80 points.

  53. Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information

    quant-ph 2026-07 accept novelty 6.5 of 10 full

    A Mathlib-compatible Lean 4 library formalizes the DPI for sandwiched Rényi relative entropy on finite-dimensional systems and supplies reusable quantum-information infrastructure.

  54. ORBIT-Q: Dual-axis benchmarking of autonomous agents in scientific quantum programming

    quant-ph 2026-07 conditional novelty 6.5 of 10

    A dual-axis agent–framework benchmark finds TensorCircuit-NG and Codex with GPT-5.5 strongest on research quantum workflows, yet agent artifacts remain slower and less complete than expert TC code.

  55. Quench Spectroscopy of Magnetic Excitations on a Superconducting Quantum Processor

    quant-ph 2026-07 accept novelty 6.5 of 10

    Quench spectroscopy on a superconducting processor extracts magnon, bound-state and two-spinon spectra of L=101 XXZ chains, including from product states in the gapless regime without ground-state preparation.

  56. Aicir: A Full-Stack Quantum Circuit Simulator with AscendNPU Support

    quant-ph 2026-08 conditional novelty 6.0 of 10

    Aicir is a full-stack quantum circuit simulator with a native Huawei Ascend NPU backend, using paired real tensors and fixed-rank gate views, validated with CPU fallback disabled.

  57. Exact quantum circuits for lattice Boltzmann realization of the Dirac equation

    quant-ph 2026-08 conditional novelty 6.0 of 10

    Every step of the three-dimensional Dirac quantum lattice Boltzmann scheme is implemented as an exact quantum circuit that reproduces a classical solver to floating point precision.

  58. Resource Estimation for Fault-Tolerant Quantum Programs

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A quantum programming language with per-codeblock error-correction annotations and a compositional resource estimator that tracks space, time, and error rates through joint Pauli measurements and decoding latency.

  59. Quantum Error Management in Practice: A Cross-Stack Benchmark

    quant-ph 2026-08 conditional novelty 6.0 of 10

    On a 156-qubit IBM Heron processor, Q-CTRL and Qedma QESEM reduced estimation error by 3.1x and 4.7x versus raw IBM execution, with QESEM using 7.5 to 11.1x the QPU time of Q-CTRL.

  60. High-level quantum structured programs as quantum registers compositions

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A formal framework for structured quantum programming where operations act on entire quantum registers, demonstrated by a quantum SMT solver prototype.

See all 343 Pith citations

Reference graph

Works this paper leans on

112 extracted references · 112 canonical work pages · cited by 343 Pith papers (see all)

  1. [1]

    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

    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. [2]

    First, a classical problem is mapped to quan- tum computation by generating circuits that encode the problem

    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. [3]

    This includes advanced circuit visualizers that display large circuits of varying characteristics (e.g

    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. [4]

    quantum computer util- ity

    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. [5]

    URL https: //qiskit.github.io/qiskit/

    Airspeed velocity of an unladen Qiskit. URL https: //qiskit.github.io/qiskit/

  6. [6]

    URL https://github.com/ Qiskit/qiskit/graphs/contributors

    Qiskit contributors. URL https://github.com/ Qiskit/qiskit/graphs/contributors

  7. [7]

    URL https://github.com/Qiskit/ qiskit

    Qiskit on Github. URL https://github.com/Qiskit/ qiskit

  8. [8]

    URL https://pypi.org/project/qiskit/

    Qiskit on the Python Package Index (PyPI). URL https://pypi.org/project/qiskit/

Show all 112 references
  1. [9]

    URL https://github.com/ qiskit-community/qiskit-cold-atom

    Qiskit Cold Atom, . URL https://github.com/ qiskit-community/qiskit-cold-atom

  2. [10]

    URL https://github.com/ Qiskit/qiskit-ibm-runtime

    Qiskit IBM Runtime, . URL https://github.com/ Qiskit/qiskit-ibm-runtime

  3. [11]

    URL https://github.com/Qiskit/ qiskit-ionq

    Qiskit IonQ, . URL https://github.com/Qiskit/ qiskit-ionq

  4. [12]

    URL https://github.com/Qiskit/ qiskit-rigetti

    Qiskit Rigetti, . URL https://github.com/Qiskit/ qiskit-rigetti

  5. [13]

    URL https://algassert.com/quirk

    Quirk. URL https://algassert.com/quirk

  6. [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

  7. [15]

    URL https://qiskit

    Qiskit Ecosystem, 2024. URL https://qiskit. github.io/ecosystem/

  8. [16]

    URL https://github

    Circuit Knitting Toolbox, 2024. URL https://github. com/Qiskit-Extensions/circuit-knitting-toolbox

  9. [17]

    URL https://github

    Qiskit SAT Synthesis, 2024. URL https://github. com/qiskit-community/qiskit-sat-synthesis

  10. [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

  11. [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

  12. [20]

    Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

    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...

  13. [21]

    Amazon Braket, 2020

    Amazon Web Services. Amazon Braket, 2020. URL https://aws.amazon.com/braket/

  14. [22]

    AutoQASM, 2024

    Amazon Web Services. AutoQASM, 2024. URL https://github.com/amazon-braket/ amazon-braket-sdk-python/tree/feature/ autoqasm/src/braket/experimental/autoqasm. 13

  15. [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

  16. [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

  17. [25]

    Wang, Patrick Rall, Edward H

    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

  18. [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

  19. [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

  20. [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.0496...

  21. [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

  22. [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

  23. [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

  24. [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 En...

  25. [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

  26. [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-dep...

  27. [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)...

  28. [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 Ar...

  29. [37]

    Cirq, July 2023

    Cirq Developers. Cirq, July 2023. URL https:// github.com/quantumlib/Cirq

  30. [38]

    Qiskit nature, April 2023

    The Qiskit Nature developers and contributors. Qiskit nature, April 2023. URL https://doi.org/10.5281/ zenodo.8161252

  31. [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

  32. [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

  33. [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), ...

  34. [43]

    Scalable circuits for preparing ground states on digital quantum computers: The schwinger model vacuum on 100 qubits

    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...

  35. [44]

    Quantum Simulations of Hadron Dynamics in the Schwinger Model using 112 Qubits

    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

  36. [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 ht...

  37. [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 brea...

  38. [47]

    Efficient tech- niques to gpu accelerations of multi-shot quantum com- puting 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

  39. [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...

  40. [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

  41. [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

  42. [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

  43. [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

  44. [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

  45. [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

  46. [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

  47. [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

  48. [57]

    Quantum measurements and the abelian stabilizer problem

    A Yu Kitaev. Quantum measurements and the abelian stabilizer problem. arXiv preprint quant-ph/9511026 , 1995

  49. [58]

    Practical and effi- cient quantum circuit synthesis and transpiling with re- inforcement 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

  50. [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,

  51. [60]

    URL https://github.com/lllingoo/2QAN

  52. [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

  53. [62]

    Qompress: Efficient compilation for ququarts exploiting partial and mixed radix opera- tions for communication reduction

    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 Int...

  54. [63]

    Universal quantum simulators

    Seth Lloyd. Universal quantum simulators. Science, 273 (5278):1073–1078, 1996

  55. [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

  56. [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

  57. [66]

    Matsakis and Felix S

    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,

  58. [67]

    ISBN 9781450332170

    Association for Computing Machinery. ISBN 9781450332170. doi:10.1145/2663171.2663188. URL https://doi.org/10.1145/2663171.2663188

  59. [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):034...

  60. [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

  61. [70]

    Benchmarking dig- ital quantum simulations and optimization above hundreds of qubits using quantum critical dynam- ics

    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

  62. [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

  63. [72]

    Experimental benchmarking of an automated de- terministic error-suppression workflow for quantum al- gorithms

    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. Phys...

  64. [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 progra...

  65. [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 Operati...

  66. [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

  67. [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

  68. [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

  69. [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 ,

  70. [79]

    doi:10.48550/arXiv.2312.00997

  71. [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

  72. [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

  73. [82]

    Optimal synthesis into fixed XX interactions

    Eric C Peterson, Lev S Bishop, and Ali Javadi-Abhari. Optimal synthesis into fixed XX interactions. Quantum, 6:696, 2022

  74. [83]

    Qiskit Dynamics: A python package for simulating the time dynamics of quantum systems

    Daniel Puzzuoli, Christopher J Wood, Daniel J Egger, Benjamin Rosand, and Kento Ueda. Qiskit Dynamics: A python package for simulating the time dynamics of quantum systems. Journal of Open Source Software , 8 (90):5853, 2023

  75. [84]

    Oqpy: Openqasm 3 + openpulse in python, Jan- uary 2024

    Philip Reinhold, Stephanie Teo, Jean-Christophe Jaskula, Li Chen, Brandur Thorgrimsson, Anurag Mishra, Mitch D’Ewart, Ryan Shaffer, Erik Davis, Yi- Ting Chen, Prasahnt Sivarajah, and Peter Karalekas. Oqpy: Openqasm 3 + openpulse in python, Jan- uary 2024. URL https://doi.org/1...

  76. [85]

    Tran, Seiji Yunoki, and Antonio Mezzacapo

    Javier Robledo-Moreno, Mario Motta, Holger Haas, Ali Javadi-Abhari, Petar Jurcevic, William Kirby, Simon Martiel, Kunal Sharma, Sandeep Sharma, Tomonori Shirakawa, Iskandar Sitdikov, Rong-Yang Sun, Kevin J Sung, Maika Takita, Minh C. Tran, Seiji Yunoki, and Antonio Mezzacapo. ...

  77. [86]

    Qrisp: A framework for com- pilable high-level programming of gate-based quantum computers

    Raphael Seidel, Sebastian Bock, Nikolay Tcholtchev, and Manfred Hauswirth. Qrisp: A framework for com- pilable high-level programming of gate-based quantum computers. PlanQC-Programming Languages for Quan- tum Computing , 2022

  78. [87]

    Suppressing correlated noise in quantum computers via context-aware compil- ing

    Alireza Seif, Haoran Liao, Vinay Tripathi, Kevin Kr- sulich, Moein Malekakhlagh, Mirko Amico, Petar Ju- rcevic, and Ali Javadi-Abhari. Suppressing correlated noise in quantum computers via context-aware compil- ing. 2024

  79. [88]

    Unveiling clean two-dimensional discrete time quasicrystals on a digital quantum computer

    Kazuya Shinjo, Kazuhiro Seki, Tomonori Shirakawa, Rong-Yang Sun, and Seiji Yunoki. Unveiling clean two-dimensional discrete time quasicrystals on a digital quantum computer. arXiv preprint arXiv:2403.16718 ,

  80. [89]

    doi:10.48550/arXiv.2403.16718

  81. [90]

    Wang, Haimeng Zhang, Nikhil Harle, Alireza Seif, Ramis Movassagh, and Zlatko Minev

    Oles Shtanko, Derek S. Wang, Haimeng Zhang, Nikhil Harle, Alireza Seif, Ramis Movassagh, and Zlatko Minev. Uncovering local integrability in quantum many- body dynamics. arXiv preprint arXiv:2307.07552 , 2023. doi:10.48550/arXiv.2307.07552

  82. [91]

    t |ket⟩: a retargetable compiler for NISQ devices

    Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan. t |ket⟩: a retargetable compiler for NISQ devices. Quantum Sci- ence and Technology , 6(1):014003, 2020. URL https: //github.com/CQCL/tket

  83. [92]

    Error mitigation in quantum computers through instruction scheduling

    Kaitlin N Smith, Gokul Subramanian Ravi, Prakash Murali, Jonathan M Baker, Nathan Earnest, Ali Javadi- Abhari, and Frederic T Chong. Error mitigation in quantum computers through instruction scheduling. arXiv preprint arXiv:2105.01760 , 2021

  84. [93]

    |01000⟩!

    Robert S Smith. Someone shouts, “ |01000⟩!” who is excited? arXiv preprint arXiv:1711.02086 , 2017

  85. [94]

    An open-source, industrial-strength optimizing compiler for quantum programs

    Robert S Smith, Eric C Peterson, Mark G Skilbeck, and Erik J Davis. An open-source, industrial-strength optimizing compiler for quantum programs. Quantum Science and Technology, 5(4):044001, 2020

  86. [95]

    C2QA-bosonic qiskit

    Timothy J Stavenger, Eleanor Crane, Kevin C Smith, Christopher T Kang, Steven M Girvin, and Nathan Wiebe. C2QA-bosonic qiskit. In 2022 IEEE High Performance Extreme Computing Conference (HPEC) , pages 1–8. IEEE, 2022

  87. [96]

    ProjectQ: an open source software framework for quan- tum computing

    Damian S Steiger, Thomas H¨ aner, and Matthias Troyer. ProjectQ: an open source software framework for quan- tum computing. Quantum, 2:49, 2018. URL https: //github.com/ProjectQ-Framework/ProjectQ

  88. [97]

    Qulacs: a fast and versatile quantum circuit simulator for research purpose

    Yasunari Suzuki, Yoshiaki Kawase, Yuya Masumura, Yuria Hiraga, Masahiro Nakadai, Jiabao Chen, Ken M Nakanishi, Kosuke Mitarai, Ryosuke Imai, Shiro Tamiya, et al. Qulacs: a fast and versatile quantum circuit simulator for research purpose. Quantum, 5: 559, 2021. URL https://git...

  89. [98]

    CutQC: using small quantum computers for large quantum circuit evalua- tions

    Wei Tang, Teague Tomesh, Martin Suchara, Jeffrey Larson, and Margaret Martonosi. CutQC: using small quantum computers for large quantum circuit evalua- tions. In Proceedings of the 26th ACM International conference on architectural support for programming languages and operati...

  90. [99]

    Giallar: Push-button verification for the qiskit quantum compiler

    Runzhou Tao, Yunong Shi, Jianan Yao, Xupeng Li, Ali Javadi-Abhari, Andrew W Cross, Frederic T Chong, and Ronghui Gu. Giallar: Push-button verification for the qiskit quantum compiler. In Proceedings of the 43rd ACM SIGPLAN International Conference on Program- ming Language Des...

  91. [100]

    RustworkX: A high- performance graph library for python

    Matthew Treinish, Ivan Carvalho, Georgios Tsilim- igkounakis, and Nahum S´ a. RustworkX: A high- performance graph library for python. Journal of Open Source Software , 7(79):3968, 2022. doi: 10.21105/joss.03968. URL https://doi.org/10. 21105/joss.03968. 16

  92. [101]

    Probabilistic error cancella- tion with sparse Pauli–Lindblad models on noisy quan- tum processors

    Ewout Van Den Berg, Zlatko K Minev, Abhinav Kan- dala, and Kristan Temme. Probabilistic error cancella- tion with sparse Pauli–Lindblad models on noisy quan- tum processors. Nature Physics, pages 1–6, 2023

  93. [102]

    Scaling quantum computing with dynamic circuits

    Almudena Carrera Vazquez, Caroline Tornow, Diego Riste, Stefan Woerner, Maika Takita, and Daniel J Eg- ger. Scaling quantum computing with dynamic circuits. arXiv preprint arXiv:2402.17833 , 2024

  94. [103]

    Dy- namical decoupling of open quantum systems

    Lorenza Viola, Emanuel Knill, and Seth Lloyd. Dy- namical decoupling of open quantum systems. Physical Review Letters, 82(12):2417, 1999

  95. [104]

    QuantumNAS: Noise-adaptive search for robust quantum circuits

    Hanrui Wang, Yongshan Ding, Jiaqi Gu, Zirui Li, Yu- jun Lin, David Z Pan, Frederic T Chong, and Song Han. QuantumNAS: Noise-adaptive search for robust quantum circuits. In The 28th IEEE International Symposium on High-Performance Computer Architec- ture (HPCA-28) , 2022. URL h...

  96. [105]

    A stabi- lizer framework for the contextual subspace variational quantum eigensolver and the noncontextual projection ansatz

    Tim Weaving, Alexis Ralli, William M Kirby, Andrew Tranter, Peter J Love, and Peter V Coveney. A stabi- lizer framework for the contextual subspace variational quantum eigensolver and the noncontextual projection ansatz. Journal of Chemical Theory and Computa- tion, 19(3):808–...

  97. [106]

    Na- tive two-qubit gates in fixed-coupling, fixed-frequency transmons beyond cross-resonance interaction

    Ken Xuan Wei, Isaac Lauer, Emily Pritchett, William Shanks, David C McKay, and Ali Javadi-Abhari. Na- tive two-qubit gates in fixed-coupling, fixed-frequency transmons beyond cross-resonance interaction. arXiv preprint arXiv:2310.12146, 2023

  98. [107]

    Egger, Stefan Filipp, Frank K

    Nicolas Wittler, Federico Roy, Kevin Pack, Max Wern- inghaus, Anurag Saha Roy, Daniel J. Egger, Stefan Filipp, Frank K. Wilhelm, and Shai Machnes. Inte- grated tool set for control, calibration, and character- ization of quantum devices applied to superconduct- ing qubits. Phy...

  99. [108]

    Nurdin, Hendra, and Naoki Yamamoto

    Toshiki Yasuda, Yudai Suzuki, Tomoyuki Kub- ota, Kohei Nakajima, Qi Gao, Wenlong Zhang, Satoshi Shimono, I. Nurdin, Hendra, and Naoki Yamamoto. Quantum reservoir computing with repeated measurements on superconducting de- vices. arXiv preprint arXiv:2310.06706 , 2023. doi: 10....

  100. [109]

    Sim- ulating large-size quantum spin chains on cloud-based superconducting quantum computers

    Hongye Yu, Yusheng Zhao, Tzu-Chieh Wei, et al. Sim- ulating large-size quantum spin chains on cloud-based superconducting quantum computers. Physical Review Research, 5(1):013183, 2023

  101. [110]

    Time-optimal qubit mapping

    Chi Zhang, Ari B Hayes, Longfei Qiu, Yuwei Jin, Yan- hao Chen, and Eddy Z Zhang. Time-optimal qubit mapping. In Proceedings of the 26th ACM Interna- tional Conference on Architectural Support for Program- ming Languages and Operating Systems , pages 360–374,

  102. [111]

    URL https://github.com/qiskit-community/ qiskit-toqm

  103. [112]

    OneQ: A compilation framework for photonic one-way quantum computation

    Hezi Zhang, Anbang Wu, Yuke Wang, Gushu Li, Hassan Shapourian, Alireza Shabani, and Yufei Ding. OneQ: A compilation framework for photonic one-way quantum computation. In Proceedings of the 50th Annual Inter- national Symposium on Computer Architecture , pages 1–14, 2023

  104. [113]

    OMhmLj6AWc/eB2JdH4sbujYqTD4=

    Victoria Zhang and Paul D. Nation. Character- izing quantum processors using discrete time crys- tals. arXiv preprint arXiv:2301.07625 , 2023. doi: 10.48550/arXiv.2301.07625. 17 Appendix A: Suppressing errors in dynamic circuits In this appendix we discuss some experimental de...

Pith tools

Reviewed May 10, 2026 · model on record in the stance chip above.