pith. sign in

arxiv: 1811.04968 · v4 · submitted 2018-11-12 · 🪐 quant-ph · cs.ET· cs.LG· physics.comp-ph

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
show 60 more authors
B. AkashNarayanan Ali Asadi Juan Miguel Arrazola Utkarsh Azad Sam Banning Carsten Blank Thomas R Bromley Benjamin A. Cordier Jack Ceroni Alain Delgado Olivia Di Matteo Amintor Dusko Tanya Garg Diego Guala Anthony Hayes Ryan Hill Aroosa Ijaz Theodor Isacsson David Ittah Soran Jahangiri Prateek Jain Edward Jiang Ankit Khandelwal Korbinian Kottmann Robert A. Lang Christina Lee Thomas Loke Angus Lowe Keri McKiernan Johannes Jakob Meyer J. A. Monta\~nez-Barrera Romain Moyard Zeyue Niu Lee James O'Riordan Steven Oud Ashish Panigrahi Chae-Yeun Park Daniel Polatajko Nicol\'as Quesada Chase Roberts Nahum S\'a Isidor Schoch Borun Shi Shuli Shu Sukin Sim Arshpreet Singh Ingrid Strandberg Jay Soni Antal Sz\'ava Slimane Thabet Rodrigo A. Vargas-Hern\'andez Trevor Vincent Nicola Vitucci Maurice Weber David Wierichs Roeland Wiersema Moritz Willmann Vincent Wong Shaoming Zhang Nathan Killoran
This is my paper

Pith reviewed 2026-05-10 15:09 UTC · model grok-4.3

classification 🪐 quant-ph cs.ETcs.LGphysics.comp-ph
keywords automatic differentiationhybrid quantum-classicalvariational quantum circuitsquantum machine learningbackpropagationquantum computing frameworkdifferentiable programmingPennyLane
0
0 comments X

The pith

PennyLane enables automatic differentiation for hybrid quantum-classical programs by making gradients of variational quantum circuits compatible with classical backpropagation.

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

The paper introduces PennyLane as a Python framework that lets users define and optimize variational quantum circuits while computing their gradients through methods that integrate directly with classical automatic differentiation. This extends standard optimization techniques from machine learning to quantum and hybrid settings, supporting both qubit and continuous-variable quantum models. A plugin architecture connects the system to various quantum simulators and hardware, while interfaces to libraries like TensorFlow and PyTorch handle the classical parts. The result is a unified way to train quantum algorithms such as variational eigensolvers and quantum approximate optimization routines.

Core claim

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-variable paradigms. PennyLane's core feature is the ability to compute gradients of variational quantum circuits in a way that is compatible with classical techniques such as backpropagation. PennyLane thus extends the automatic differentiation algorithms common in optimization and machine learning to include quantum and hybrid computations. A plugin system makes the framework compatible with any gate-based quantum simulator or hardware.

What carries the argument

Gradient computation for variational quantum circuits that remains compatible with classical backpropagation, supported by a plugin system for connecting to quantum simulators and hardware.

Load-bearing premise

The plugin system provides seamless, accurate, and efficient interfacing with arbitrary gate-based quantum simulators or hardware without introducing significant numerical or performance issues.

What would settle it

Compute the gradient of a simple parameterized quantum circuit both analytically and through PennyLane on the same simulator, then check whether the two results match within numerical tolerance.

read the original abstract

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices, supporting both qubit and continuous-variable paradigms. PennyLane's core feature is the ability to compute gradients of variational quantum circuits in a way that is compatible with classical techniques such as backpropagation. PennyLane thus extends the automatic differentiation algorithms common in optimization and machine learning to include quantum and hybrid computations. A plugin system makes the framework compatible with any gate-based quantum simulator or hardware. We provide plugins for hardware providers including the Xanadu Cloud, Amazon Braket, and IBM Quantum, allowing PennyLane optimizations to be run on publicly accessible quantum devices. On the classical front, PennyLane interfaces with accelerated machine learning libraries such as TensorFlow, PyTorch, JAX, and Autograd. PennyLane can be used for the optimization of variational quantum eigensolvers, quantum approximate optimization, quantum machine learning models, and many other applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces PennyLane, a Python 3 software framework for differentiable programming of quantum computers. It provides a unified architecture supporting both qubit and continuous-variable quantum devices via a plugin system, with the core capability being automatic differentiation of variational quantum circuits that integrates with classical backpropagation and machine-learning libraries such as TensorFlow, PyTorch, JAX, and Autograd. The framework is positioned for applications including VQE, QAOA, and quantum machine learning, with plugins enabling execution on hardware from Xanadu, Amazon Braket, and IBM Quantum.

Significance. If the described architecture and gradient interfaces function as claimed, PennyLane would be a notable contribution by extending classical automatic-differentiation techniques to hybrid quantum-classical settings, thereby lowering the barrier to gradient-based optimization of near-term quantum algorithms. The open-source plugin design and explicit compatibility with multiple hardware providers and ML frameworks are concrete strengths that could accelerate reproducible research in variational quantum methods.

major comments (2)
  1. [§3] §3 (core architecture) and the gradient section: the central claim that quantum gradients are computed in a manner fully compatible with classical backpropagation relies on the parameter-shift rule and the plugin interface, yet the manuscript provides no explicit derivation or pseudocode showing how the quantum gradient tensor is inserted into the classical computational graph; without this, it is difficult to verify that the hybrid differentiation is free of hidden assumptions about device noise or shot statistics.
  2. [§4] §4 (plugin system) and associated tables/figures: the assertion of seamless interfacing with arbitrary simulators and hardware is load-bearing for the unified-architecture claim, but the text supplies no quantitative benchmarks (runtime, gradient accuracy, or memory overhead) across the listed providers; this omission leaves open whether numerical or performance artifacts are introduced when switching devices.
minor comments (2)
  1. [Figure 1] Figure 1 and the accompanying caption: the schematic of the hybrid computation graph would benefit from explicit labeling of the quantum-to-classical gradient hand-off point to improve readability for readers unfamiliar with the parameter-shift implementation.
  2. [Abstract] The abstract states that PennyLane 'extends the automatic differentiation algorithms' but does not cite the specific classical AD libraries' gradient interfaces (e.g., TensorFlow's GradientTape) that are being extended; adding one or two references would clarify the novelty.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive evaluation and recommendation of minor revision. The comments identify opportunities to strengthen the presentation of the hybrid differentiation mechanism and the plugin architecture. We address each point below and will incorporate clarifications and additional material in the revised manuscript.

read point-by-point responses

  1. Referee: [§3] §3 (core architecture) and the gradient section: the central claim that quantum gradients are computed in a manner fully compatible with classical backpropagation relies on the parameter-shift rule and the plugin interface, yet the manuscript provides no explicit derivation or pseudocode showing how the quantum gradient tensor is inserted into the classical computational graph; without this, it is difficult to verify that the hybrid differentiation is free of hidden assumptions about device noise or shot statistics.

    Authors: We appreciate this request for greater explicitness. Section 3 presents the parameter-shift rule, which yields exact gradients for gates of the form exp(-iθG) where G has eigenvalues ±1 and requires no finite-difference approximation or assumptions about device noise. The resulting gradient tensor is returned by the QNode and is directly consumable by classical autodiff frameworks because PennyLane registers it as a differentiable operation. To address the referee’s concern, we will add a short pseudocode listing and a schematic diagram in the revised §3 that shows the sequence: (1) forward pass on the quantum device, (2) parameter-shift evaluations, (3) assembly of the gradient tensor, and (4) insertion into the classical computational graph. Regarding shot statistics, the number of shots is an explicit device parameter; the gradient estimator inherits the same shot noise as the expectation-value estimator, which is already documented in the device interface. No hidden assumptions about noise models are made. revision: yes

  2. Referee: [§4] §4 (plugin system) and associated tables/figures: the assertion of seamless interfacing with arbitrary simulators and hardware is load-bearing for the unified-architecture claim, but the text supplies no quantitative benchmarks (runtime, gradient accuracy, or memory overhead) across the listed providers; this omission leaves open whether numerical or performance artifacts are introduced when switching devices.

    Authors: We agree that quantitative evidence would reinforce the claim of seamless interfacing. The manuscript emphasizes the architectural design and provides usage examples, but does not contain systematic cross-device benchmarks. In the revision we will add a concise benchmark subsection (or table) that reports wall-clock time, gradient accuracy relative to analytic values, and peak memory usage for a representative variational circuit executed on the default.qubit simulator, the Strawberry Fields simulator, and the IBM Qiskit simulator. These results will demonstrate that the core PennyLane layer introduces negligible overhead and that numerical fidelity is preserved across backends, as the plugin layer only translates the circuit and returns expectation values. revision: yes

Circularity Check

0 steps flagged

No circularity: software framework with no load-bearing derivations

full rationale

The paper presents PennyLane as a Python framework for differentiable quantum programming, with its central claim being the extension of automatic differentiation (via parameter-shift rules and backpropagation interfaces) to hybrid quantum-classical circuits through a plugin architecture. No equations, fitted parameters, or uniqueness theorems are invoked as derivations; the contribution is architectural and implementational. Claims about gradient computation and device compatibility are statements of provided functionality rather than predictions that reduce to inputs by construction. Self-citations (if any) are not load-bearing for any result, as the paper is self-contained in describing its own interfaces without relying on prior author work to force outcomes. This is a normal non-finding for a software library paper.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on standard assumptions from quantum computing and automatic differentiation without introducing new free parameters or invented entities.

axioms (1)
  • domain assumption Parameterized quantum circuits admit well-defined gradients with respect to their parameters that can be computed via automatic differentiation techniques.
    This underpins the core claim of compatibility with classical backpropagation.

pith-pipeline@v0.9.0 · 5789 in / 1095 out tokens · 47263 ms · 2026-05-10T15:09:23.239960+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 60 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Qvine: Vine Structured Quantum Circuits for Loading High Dimensional Distributions

    quant-ph 2026-04 unverdicted novelty 8.0

    Qvine uses vine copula-inspired quantum circuit structures to achieve linear or quadratic depth scaling for loading high-dimensional distributions with high approximation quality.

  2. Reductions of QAOA Induced by Classical Symmetries: Theoretical Insights and Practical Implications

    quant-ph 2026-02 conditional novelty 8.0

    Symmetry reductions in QAOA for MaxCut can collapse DLA dimensions from exponential to quadratic depending on the fixed variable, with graph embeddings ensuring expressivity and improved trainability.

  3. Halving the cost of QROM

    quant-ph 2026-05 unverdicted novelty 7.0

    New SelectCopy architecture and qubit-constrained optimizations reduce QROM Toffoli cost from ~2N/λ to ~(1 + 1/b)N/λ while preserving the ability to trade dirty qubits for lower gate count.

  4. QLAM: A Quantum Long-Attention Memory Approach to Long-Sequence Token Modeling

    cs.LG 2026-05 unverdicted novelty 7.0

    QLAM extends state-space models with quantum superposition in the hidden state for linear-time long-sequence modeling and reports consistent gains over RNN and transformer baselines on sequential image tasks.

  5. Optimal FALQON for Quantum Approximate Optimization via Layer-wise Parameter Tuning

    quant-ph 2026-05 unverdicted novelty 7.0

    Optimal FALQON optimizes per-layer δ_k and M_k via classical methods, yielding statistically significant gains in success probability and efficiency over standard FALQON on 94 non-isomorphic 3-regular graphs with 12 vertices.

  6. Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    Gated QKAN-FWP combines fast weight programming with quantum-inspired Kolmogorov-Arnold networks via single-qubit DARUAN activations and gated updates to deliver a 12.5k-parameter model that outperforms larger classic...

  7. Architecture Shape Governs QNN Trainability: Jacobian Null Space Growth and Parameter Efficiency

    quant-ph 2026-05 unverdicted novelty 7.0

    At fixed encoding budget, serial QNN architectures suffer unbounded structural gradient starvation via rank(J) ≤ 2L+1 while parallel ones keep full Jacobian rank and better parameter efficiency when adding feature-map layers.

  8. Randomized and Diverse Input State Generation for Quantum Program Testing

    cs.SE 2026-05 unverdicted novelty 7.0

    The hardware-compatible Brick-Circuit generator produces quantum test states with higher expressibility and entanglement than existing generators at shallower circuit depths.

  9. Quantum Interval Bound Propagation for Certified Training of Quantum Neural Networks

    quant-ph 2026-05 unverdicted novelty 7.0

    QIBP adapts interval bound propagation to quantum neural networks for certified adversarial robustness via interval and affine arithmetic implementations.

  10. Beyond Single Trajectories: Optimal Control and Jordan-Lie Algebra in Hybrid Quantum Walks for Combinatorial Optimization

    quant-ph 2026-04 unverdicted novelty 7.0

    Hybrid quantum walks with optimal dynamical coin operators outperform QAOA on Max-Cut and MIS by accessing a strictly larger Jordan-Lie algebra that enables faster convergence and higher accuracy.

  11. Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes

    quant-ph 2026-04 unverdicted novelty 7.0

    A graph-conditioned meta-optimizer learns QAOA parameter trajectories from one problem class and transfers them to others, yielding better initializations than standard methods in an empirical study of 64 settings.

  12. Architecture-aware Unitary Synthesis

    quant-ph 2026-04 unverdicted novelty 7.0

    A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.

  13. Q-SINDy: Quantum-Kernel Sparse Identification of Nonlinear Dynamics with Provable Coefficient Debiasing

    quant-ph 2026-04 accept novelty 7.0

    Q-SINDy adds quantum kernels to SINDy and proves that orthogonalization eliminates coefficient cannibalization bias exactly, recovering equations as accurately as classical SINDy on six tested systems.

  14. Lund Plane to Bloch (LP2B) Encoding for Object and Polarization Tagging with Quantum Jet Substructure

    quant-ph 2026-04 unverdicted novelty 7.0

    LP2B encoding converts Lund plane jet representations into Bloch sphere qubit states, enabling a QTTN that matches classical LundNet performance on polarization tagging and W/top tagging with three orders of magnitude...

  15. Variational Quantum Physics-Informed Neural Networks for Hydrological PDE-Constrained Learning with Inherent Uncertainty Quantification

    quant-ph 2026-04 unverdicted novelty 7.0

    Hybrid quantum PINN for hydrology reports 3x faster convergence and 44% fewer parameters than classical PINN on Sri Lankan flood data while using physics constraints for uncertainty quantification.

  16. A hardware efficient quantum residual neural network without post-selection

    quant-ph 2026-04 unverdicted novelty 7.0

    A quantum residual neural network implements skip connections via fixed linear mixing of identity and variational circuits, achieving 99% binary and 80% multi-class image classification accuracy with 10x fewer gates t...

  17. A hardware efficient quantum residual neural network without post-selection

    quant-ph 2026-04 unverdicted novelty 7.0

    A quantum residual neural network using deterministic mixtures of identity and variational unitaries to enable post-selection-free residual learning with 10x fewer gates and reported accuracies of 99% binary and 80% m...

  18. Broken Quantum: A Systematic Formal Verification Study of Security Vulnerabilities Across the Open-Source Quantum Computing Simulator Ecosystem

    cs.CR 2026-04 unverdicted novelty 7.0

    A formal audit of 45 quantum simulators identifies 547 vulnerabilities across memory corruption, resource exhaustion, code injection, and a new QASM injection class, with all patterns verified by Z3 SAT proofs.

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

    quant-ph 2026-04 unverdicted novelty 7.0

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

  20. MerLin: A Discovery Engine for Photonic and Hybrid Quantum Machine Learning

    cs.LG 2026-02 unverdicted novelty 7.0

    MerLin is a new open-source discovery engine for photonic and hybrid quantum machine learning that integrates circuit simulations into standard ML frameworks and reproduces 18 prior works as reusable benchmarks.

  21. A Methodological Analysis of Empirical Studies in Quantum Software Testing

    quant-ph 2026-01 accept novelty 7.0

    A systematic analysis of 59 quantum software testing empirical studies reveals highly diverse designs, inconsistent reporting, and open methodological challenges, leading to recommendations for future work.

  22. Quantum Masked Autoencoders for Vision Learning

    quant-ph 2025-11 unverdicted novelty 7.0

    Quantum masked autoencoders reconstruct masked MNIST-family images in quantum states and achieve 12.86% higher average classification accuracy than prior quantum autoencoders under masking.

  23. SoK: Critical Evaluation of Quantum Machine Learning for Adversarial Robustness

    cs.CR 2025-11 conditional novelty 7.0

    A systematization of knowledge paper that empirically evaluates five adversarial attacks on quantum multilayer perceptrons across encodings and depths, identifying an accuracy-robustness trade-off and differences from...

  24. SoK: Critical Evaluation of Quantum Machine Learning for Adversarial Robustness

    cs.CR 2025-11 unverdicted novelty 7.0

    The paper delivers the first comprehensive systematization of adversarial robustness in QML with new empirical tests showing an accuracy-robustness trade-off, amplitude encoding's vulnerability, and QML's greater susc...

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

    cs.PL 2025-11 unverdicted novelty 7.0

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

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

    quant-ph 2025-08 unverdicted novelty 7.0

    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.

  27. The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization

    quant-ph 2025-05 unverdicted novelty 7.0

    The paper decomposes dynamical Lie algebras of XY-mixer topologies and demonstrates warm-starting QAOA via pre-training on restricted generators to improve convergence on constrained optimization problems.

  28. Exploring nontrivial topology at quantum criticality in a superconducting processor

    quant-ph 2025-01 unverdicted novelty 7.0

    Experimental preparation of topologically nontrivial critical states of the cluster Ising model on a 100-qubit superconducting processor, verified by boundary g-function and two-fold entanglement spectrum degeneracy u...

  29. An Operational Framework for Nonclassicality in Quantum Communication Networks

    quant-ph 2024-03 unverdicted novelty 7.0

    A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...

  30. Local-Observable-Guided Generative Quantum Circuits for Degenerate Ground Spaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hybrid generative quantum circuits guided by local observable correlators sample diverse ensembles whose span reproduces degenerate ground spaces in Majumdar-Ghosh, AKLT, and XXZ models.

  31. Adaptive Measurement Allocation for Learning Kernelized SVMs Under Noisy Observations

    cs.LG 2026-05 unverdicted novelty 6.0

    Introduces geometric-sensitivity and active-set-instability signals to adaptively allocate measurements for kernel SVMs under Bernoulli noise, with theory and synthetic/quantum-kernel experiments showing improved marg...

  32. QUTest: A Native Testing Framework for Quantum Programs

    quant-ph 2026-05 unverdicted novelty 6.0

    QUTest is a native OpenQASM testing framework that encodes Arrange/Act/Assert tests and 12 assertion types via pragma comments while remaining compatible with existing tools.

  33. Quantum Feature Pyramid Gating for Seismic Image Segmentation

    quant-ph 2026-05 conditional novelty 6.0

    A 4-qubit quantum feature pyramid gating architecture raises mean IoU from 0.8404 to 0.9389 over classical addition in controlled ablations on the TGS salt segmentation dataset.

  34. Quantum End-to-End Learning for Contextual Combinatorial Optimization

    quant-ph 2026-05 unverdicted novelty 6.0

    QEL is the first quantum end-to-end learning framework for contextual combinatorial optimization using QAOA with a context re-uploading phase-separator, achieving competitive performance with fewer parameters.

  35. A QPINN Framework with Quantum Trainable Embeddings for the Lid-Driven Cavity Problem

    quant-ph 2026-05 unverdicted novelty 6.0

    QPINN framework with QNN-based trainable embeddings solves the lid-driven cavity problem with stable training, competitive accuracy, and fewer parameters than classical PINNs.

  36. Don't Get Your Kroneckers in a Twist: Gaussian Processes on High-Dimensional Incomplete Grids

    cs.LG 2026-05 unverdicted novelty 6.0

    CUTS-GPR performs numerically exact Gaussian process regression with near-linear scaling in training points N and low-order polynomial scaling in dimensions D by exploiting additive kernels on incomplete grids.

  37. The power of entanglement in distributed quantum machine learning

    quant-ph 2026-05 unverdicted novelty 6.0

    Entanglement improves classification accuracy in distributed quantum ML tasks across datasets, but excessive amounts degrade performance by reducing effective parameter dimension.

  38. Quantum Hierarchical Reinforcement Learning via Variational Quantum Circuits

    cs.LG 2026-05 unverdicted novelty 6.0

    Hybrid agent with variational quantum circuits for feature extraction in hierarchical RL outperforms classical baselines with 66% parameter savings, but quantum value estimation degrades results.

  39. Quantum Tilted Loss in Variational Optimization: Theory and Applications

    quant-ph 2026-05 unverdicted novelty 6.0

    QTL unifies expectation-value minimization with CVaR and Gibbs heuristics under one tunable operator, amplifying gradients in structured cases while preserving global minima and shifting the bottleneck to measurement ...

  40. Geometric Quantum Physics Informed Neural Network

    quant-ph 2026-05 unverdicted novelty 6.0

    GQPINNs add symmetry awareness to quantum PINNs via equivariant circuits, yielding lower mean absolute error and fewer parameters than standard QPINNs on linear and nonlinear PDE benchmarks.

  41. Towards Real-time Control of a CartPole System on a Quantum Computer

    quant-ph 2026-05 unverdicted novelty 6.0

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

  42. Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hardware-efficient gates are universal for state preparation in particle-number and symmetry-constrained subspaces because commutators generate Pauli Z projectors that span the full so(w) and su(w) algebras.

  43. Defending Quantum Classifiers against Adversarial Perturbations through Quantum Autoencoders

    quant-ph 2026-04 unverdicted novelty 6.0

    A quantum autoencoder purifies adversarial perturbations for quantum classifiers and supplies a confidence score for unrecoverable inputs, claiming up to 68% accuracy gains over prior defenses without adversarial training.

  44. Controlled Steering-Based State Preparation for Adversarial-Robust Quantum Machine Learning

    quant-ph 2026-04 unverdicted novelty 6.0

    A passive steering method for quantum state preparation improves adversarial accuracy in QML models by up to 40% across tested cases.

  45. QuanForge: A Mutation Testing Framework for Quantum Neural Networks

    cs.SE 2026-04 unverdicted novelty 6.0

    QuanForge introduces statistical mutation killing and nine post-training mutation operators for QNNs to distinguish test suites and localize vulnerable circuit regions.

  46. Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture

    quant-ph 2026-04 unverdicted novelty 6.0

    Syn@fac optimization reduces estimated circuit failure probability by a factor of 9 on average across non-Clifford benchmarks for bivariate bicycle code modular FTQC architectures, with additional gains from transvect...

  47. Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface

    quant-ph 2026-04 unverdicted novelty 6.0

    The Eclipse Qrisp BlockEncoding interface provides high-level programming abstractions for block-encodings, enabling easier implementation of quantum algorithms such as QSVT, matrix inversion, and Hamiltonian simulation.

  48. Hierarchical Progressive Pauli Noise Modeling with Residual Compensation for Multi-Qubit Quantum Circuits

    quant-ph 2026-04 unverdicted novelty 6.0

    HPO framework reduces multi-qubit Pauli noise characterization complexity from O(4^N) to O(N·4^w) with 96.3% parameter compression on 5 qubits and raises 10-qubit HHL fidelity from 0.7431 to 0.9381.

  49. Double Descent in Quantum Kernel Ridge Regression

    quant-ph 2026-04 unverdicted novelty 6.0

    Quantum kernel ridge regression shows double descent in test risk, with the interpolation peak suppressible by regularization, via random matrix theory asymptotics in the high-dimensional limit.

  50. Observable-Guided Generator Selection for Improving Trainability in Quantum Machine Learning with a $ \mathfrak{g} $-Purity Interpretation under Restricted Settings

    quant-ph 2026-04 unverdicted novelty 6.0

    Observable-guided selection of anti-commuting Pauli generators improves training speed in 5-qubit QML circuits and admits a g-purity interpretation under restricted algebraic assumptions.

  51. QLLVM: A Scalable Quantum-Classical Co-Compilation Framework based on LLVM

    quant-ph 2026-04 unverdicted novelty 6.0

    QLLVM delivers an LLVM-based end-to-end co-compiler that unifies classical HPC and quantum programs into one executable, with a three-stage quantum path via MLIR and QIR that reduces circuit depth and gate counts on M...

  52. Learning to Concatenate Quantum Codes

    quant-ph 2026-04 unverdicted novelty 6.0

    A machine-learning approach adaptively chooses quantum code sequences for concatenation to achieve target logical error rates with far fewer qubits than standard methods for structured noise.

  53. Parameter-efficient Quantum Multi-task Learning

    cs.LG 2026-04 unverdicted novelty 6.0

    QMTL uses shared VQC encoding plus task-specific quantum ansatz heads to achieve linear parameter scaling with the number of tasks while matching or exceeding classical multi-task baselines on three benchmarks.

  54. Quantum-Enhanced Single-Parameter Phase Estimation with Adaptive NOON States

    quant-ph 2026-04 unverdicted novelty 6.0

    Optimizing eight circuit parameters via gradient descent on classical Fisher information yields up to 1598% CFI gains and 133x more useful events per pulse for N=5 NOON states, pushing performance closer to the Heisen...

  55. Adaptive H-EFT-VA: A Provably Safe Trajectory Through the Trainability-Expressibility Landscape of Variational Quantum Algorithms

    quant-ph 2026-04 unverdicted novelty 6.0

    Adaptive H-EFT-VA maintains gradient variance Omega(1/poly(N)) during safe Hilbert space expansion, doubling fidelity over static H-EFT-VA on benchmarks up to 14 qubits.

  56. Quantum Patches: Enhancing Robustness of Quantum Machine Learning Models

    quant-ph 2026-04 unverdicted novelty 6.0

    Random quantum circuits used as adversarial training data reduce successful attack rates on QML models for CIFAR-10 from 89.8% to 68.45% and for CINIC-10 from 94.23% to 78.68%.

  57. Shot-Based Quantum Encoding: A Data-Loading Paradigm for Quantum Neural Networks

    quant-ph 2026-04 unverdicted novelty 6.0

    SBQE encodes data via learnable shot distributions over initial states to form mixed quantum representations, achieving 89.1% accuracy on Semeion and 80.95% on Fashion MNIST without encoding gates.

  58. Molecular Excited States using Quantum Subspace Methods: Accuracy, Resource Reduction, and Error-Mitigated Hardware Implementation of q-sc-EOM

    quant-ph 2026-04 conditional novelty 6.0

    Optimized q-sc-EOM on quantum hardware yields accurate excited-state energies for challenging molecular bond-breaking cases after reducing measurement scaling to O(N^5) and applying readout and symmetry error mitigation.

  59. Eliminating Vendor Lock-In in Quantum Machine Learning via Framework-Agnostic Neural Networks

    cs.ET 2026-04 unverdicted novelty 6.0

    A new QNN architecture with unified graph, HAL, and ONNX pipeline enables cross-framework and cross-hardware QML with training time within 8% of native implementations and identical accuracy on Iris, Wine, and MNIST-4 tasks.

  60. Practical Quantum Federated Learning for Privacy-Sensitive Healthcare: Communication Efficiency and Noise Resilience

    quant-ph 2026-03 unverdicted novelty 6.0

    Hybrid QFL cuts quantum transmissions from 3TNMP to {3t + 2(T-t)}NMP over T rounds while preserving near-centralized convergence and improving depolarizing-noise resilience via decentralized aggregation and Steane-code QEC.

Reference graph

Works this paper leans on

82 extracted references · 82 canonical work pages · cited by 118 Pith papers · 1 internal anchor

  1. [1]

    Prepare an initial state (here assumed to be the ground or vacuum state|0〉)

    work page

  2. [2]

    Each gate is either a fixed operation, or it can depend on some of the inputs x or the variables θ

    Apply a sequence of unitary gates U (or more gen- erally , quantum operations or channels) to|0〉. Each gate is either a fixed operation, or it can depend on some of the inputs x or the variables θ. This prepares the final stateU(x, θ )|0〉

    work page

  3. [3]

    real data

    Measure m mutually commuting scalar observablesˆBi in the final state. Step 2 describes the way inputs x are encoded into the variational circuit, namely by associating them with gate parameters that are not used as trainable variables5. Step 3 describes the way quantum information is transformed back to the classical output of a quantum node as the expect...

    work page

  4. [4]

    For example, this allows for simulators that support the classical efficient ’adjoint’ method of differentiation [46]

    If the device provides its own gradient method, this is the default choice. For example, this allows for simulators that support the classical efficient ’adjoint’ method of differentiation [46]

    work page

  5. [5]

    If the device is computing expectation values exactly (shots=None) and supports backpropagation, this is the next choice

    work page

  6. [6]

    If exe- cuting on hardware devices, or with simulators where shots!=None, a parameter-shift gradient transform is the next best choice

    Most quantum nodes permit analytic derivatives on hardware via parameter-shift rules [47, 48]. If exe- cuting on hardware devices, or with simulators where shots!=None, a parameter-shift gradient transform is the next best choice

    work page

  7. [7]

    Step {i}: cost: {cost}

    Finally , if the circuit does not permit analytic hard- ware gradients, numerical methods such as the method of finite differences is applied. Analytic derivatives Recent advances in the quantum machine learning liter- ature [8, 10, 11, 49 ] have suggested ways to estimate an- alytic derivatives by computing linear combinations of dif- ferent quantum circu...

    work page

  8. [8]

    Examples in- clude qml.draw() (for drawing quantum cir- cuits), qml.specs() (resource information), and qml.matrix() (extract the matrix representation of the circuit unitary)

    Classical transforms : These transforms extract information from quantum functions without execting the underlying device. Examples in- clude qml.draw() (for drawing quantum cir- cuits), qml.specs() (resource information), and qml.matrix() (extract the matrix representation of the circuit unitary)

    work page

  9. [9]

    default.qubit

    Quantum transforms: These transforms extract in- formation from quantum nodes by generating one or more quantum circuits, and post-processing the re- sults with classical processing. Thus, in contrast to the ‘classical’ transform, the quantum transform requires additional quantum device evaluations in order to compute the requested quantity . Aside from t...

    work page

  10. [10]

    A variational eigenvalue solver on a pho- tonic quantum processor,

    Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’Brien, “A variational eigenvalue solver on a pho- tonic quantum processor,” Nature Communications 5, 4213 (2014)

    work page 2014

  11. [11]

    A Quantum Approximate Optimization Algorithm

    Edward Farhi, Jeffrey Goldstone, and Sam Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint (2014), arxiv:1411.4028

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  12. [12]

    Variational Quantum Factoring

    Eric R Anschuetz, Jonathan P Olson, Alán Aspuru-Guzik, and Yudong Cao, “Variational quantum factoring,” arXiv preprint (2018), arxiv:1808.08927

    work page Pith review arXiv 2018

  13. [13]

    Variational Quantum State Diagonalization

    Ryan LaRose, Arkin Tikku, Étude O’Neel-Judy , Lukasz Cincio, and Patrick J Coles, “Variational quantum state diagonaliza- tion,” arXiv preprint (2018), arxiv:1810.10506

    work page Pith review arXiv 2018

  14. [14]

    Quantum autoencoders for efficient compression of quantum data,

    Jonathan Romero, Jonathan P Olson, and Alan Aspuru- Guzik, “Quantum autoencoders for efficient compression of quantum data,” Quantum Science and Technology2, 045001 (2017)

    work page 2017

  15. [15]

    QVECTOR: an algorithm for device-tailored quantum error correction

    Peter D Johnson, Jonathan Romero, Jonathan Olson, Yudong Cao, and Alán Aspuru-Guzik, “QVECTOR: an algorithm for device-tailored quantum error correction,” arXiv preprint (2017), arxiv:1711.02249

    work page Pith review arXiv 2017

  16. [16]

    Verdon, M

    Guillaume Verdon, Michael Broughton, and Jacob Bi- amonte, “A quantum algorithm to train neural net- works using low-depth circuits,” arXiv preprint (2017), arxiv:1712.05304

    work page arXiv 2017

  17. [17]

    Classification with Quantum Neural Networks on Near Term Processors

    Edward Farhi and Hartmut Neven, “Classification with quantum neural networks on near term processors,” arXiv preprint (2018), arxiv:1802.06002

    work page Pith review arXiv 2018

  18. [18]

    Quantum machine learning in feature Hilbert spaces

    Maria Schuld and Nathan Killoran, “Quantum machine learning in feature Hilbert spaces,” arXiv preprint (2018), arxiv:1803.07128

    work page Pith review arXiv 2018

  19. [19]

    Quantum Circuit Learning

    Kosuke Mitarai, Makoto Negoro, Masahiro Kitagawa, and Keisuke Fujii, “Quantum circuit learning,” Phys. Rev. A 98, 032309 (2018), arxiv:1803.00745

    work page Pith review arXiv 2018

  20. [20]

    Schuld, A

    Maria Schuld, Alex Bocharov, Krysta Svore, and Nathan Wiebe, “Circuit-centric quantum classifiers,” arXiv preprint (2018), arxiv:1804.00633

    work page arXiv 2018

  21. [21]

    Hierarchical quantum classifiers,

    Edward Grant, Marcello Benedetti, Shuxiang Cao, Andrew Hallam, Joshua Lockhart, Vid Stojevic, Andrew G Green, and Simone Severini, “Hierarchical quantum classifiers,” arXiv preprint (2018), arxiv:1804.03680

    work page arXiv 2018

  22. [22]

    Differentiable Learning of Quantum Circuit Born Machine

    Jin-Guo Liu and Lei Wang, “Differentiable learning of quantum circuit Born machine,” arXiv preprint (2018), arxiv:1804.04168

    work page Pith review arXiv 2018

  23. [23]

    Quantum generative adversarial networks,

    Pierre-Luc Dallaire-Demers and Nathan Killoran, “Quantum generative adversarial networks,” Physical Review A 98, 012324 (2018)

    work page 2018

  24. [24]

    Supervised learning with quantum enhanced feature spaces

    Vojtech Havlicek, Antonio D Córcoles, Kristan Temme, Aram W Harrow, Jerry M Chow, and Jay M Gambetta, “Su- pervised learning with quantum enhanced feature spaces,” arXiv preprint (2018), arxiv:1804.11326

    work page Pith review arXiv 2018

  25. [25]

    Universal discrimi- native quantum neural networks,

    Hongxiang Chen, Leonard Wossnig, Simone Severini, Hart- mut Neven, and Masoud Mohseni, “Universal discrimi- native quantum neural networks,” arXiv preprint (2018), arxiv:1805.08654

    work page arXiv 2018

  26. [26]

    Killoran, T

    Nathan Killoran, Thomas R Bromley , Juan Miguel Arra- zola, Maria Schuld, Nicolás Quesada, and Seth Lloyd, “Continuous-variable quantum neural networks,” arXiv preprint (2018), arxiv:1806.06871

    work page arXiv 2018

  27. [27]

    Quantum optical neural networks

    Gregory R Steinbrecher, Jonathan P Olson, Dirk Englund, and Jacques Carolan, “Quantum optical neural networks,” arXiv preprint (2018), arxiv:1808.10047

    work page Pith review arXiv 2018

  28. [28]

    LIQUi|>: A software de- 17 sign architecture and domain-specific language for quantum computing,

    Dave Wecker and Krysta M. Svore, “LIQUi|>: A software de- 17 sign architecture and domain-specific language for quantum computing,” arXiv preprint (2014), arxiv:1402.4467

    work page arXiv 2014

  29. [29]

    qHiPSTER: The Quantum High Performance Software Testing Environment

    Mikhail Smelyanskiy , Nicolas PD Sawaya, and Alán Aspuru-Guzik, “qHiPSTER: the quantum high performance software testing environment,” arXiv preprint (2016), arxiv:1601.07195

    work page Pith review arXiv 2016

  30. [30]

    IBM Corporation, “Qiskit,” (2016)

    work page 2016

  31. [31]

    Pro- jectQ: an open source software framework for quantum com- puting,

    Damian S Steiger, Thomas Häner, and Matthias Troyer, “Pro- jectQ: an open source software framework for quantum com- puting,” Quantum 2, 49 (2018)

    work page 2018

  32. [32]

    Forest SDK,

    Rigetti Computing, “Forest SDK,” (2017)

    work page 2017

  33. [33]

    Quantum Development Kit,

    Microsoft Corporation, “Quantum Development Kit,” (2017)

    work page 2017

  34. [34]

    Strawberry Fields: A Software Platform for Photonic Quantum Computing

    Nathan Killoran, Josh Izaac, Nicolás Quesada, Ville Bergholm, Matthew Amy , and Christian Weedbrook, “Straw- berry Fields: A software platform for photonic quantum com- puting,” arXiv preprint (2018), arxiv:1804.03159

    work page Pith review arXiv 2018

  35. [35]

    Google Inc., “Cirq,” (2018)

    work page 2018

  36. [36]

    Quantum circuits with many photons on a programmable nanophotonic chip,

    J.M. Arrazola, V . Bergholm, K. Brádler, T .R. Bromley , M.J. Collins, I. Dhand, A. Fumagalli, T . Gerrits, A. Goussev, L.G. Helt, J. Hundal, T . Isacsson, R.B. Israel, J. Izaac, S. Jahangiri, R. Janik, N. Killoran, S.P . Kumar, J. Lavoie, A.E. Lita, D.H. Mahler, M. Menotti, B. Morrison, S.W . Nam, L. Neuhaus, H.Y. Qi, N. Quesada, A. Repingon, K.K. Sabapa...

    work page 2021

  37. [37]

    Amazon Braket,

    Amazon Web Services, “Amazon Braket,” (2020)

    work page 2020

  38. [38]

    IBM Quantum Experience,

    IBM Corporation, “IBM Quantum Experience,” (2016)

    work page 2016

  39. [39]

    Quantum machine learning toolbox,

    Xanadu Inc., “Quantum machine learning toolbox,” (2018)

    work page 2018

  40. [40]

    A framework for algorithm deploy- ment on cloud-based quantum computers,

    Sukin Sim, Yudong Cao, Jonathan Romero, Peter D Johnson, and Alan Aspuru-Guzik, “A framework for algorithm deploy- ment on cloud-based quantum computers,” arXiv preprint (2018), arxiv:1810.10576

    work page arXiv 2018

  41. [41]

    Broughton, G

    Michael Broughton, Guillaume Verdon, Trevor McCourt, An- tonio J Martinez, Jae Hyeon Yoo, Sergei V Isakov, Philip Massey , Ramin Halavati, Murphy Yuezhen Niu, Alexan- der Zlokapa, et al. , “Tensorflow quantum: A software framework for quantum machine learning,” arXiv preprint arXiv:2003.02989 (2020)

    work page arXiv 2003

  42. [42]

    Yao. jl: Extensible, efficient framework for quantum algorithm de- sign,

    Xiu-Zhe Luo, Jin-Guo Liu, Pan Zhang, and Lei Wang, “Yao. jl: Extensible, efficient framework for quantum algorithm de- sign,” Quantum 4, 341 (2020)

    work page 2020

  43. [43]

    Autograd: Effortless gradients in numpy ,

    Dougal Maclaurin, David Duvenaud, and Ryan P Adams, “Autograd: Effortless gradients in numpy ,” inICML 2015 Au- toML Workshop (2015)

    work page 2015

  44. [44]

    Tensor- Flow: a system for large-scale machine learning

    Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghe- mawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek G. Mur- ray , Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete War- den, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng, “Tensor- Flow: a system...

    work page 2016

  45. [45]

    Automatic dif- ferentiation in PyTorch,

    Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer, “Automatic dif- ferentiation in PyTorch,” (2017)

    work page 2017

  46. [46]

    JAX: composable transformations of Python+NumPy programs,

    James Bradbury , Roy Frostig, Peter Hawkins, Matthew James Johnson, Chris Leary , Dougal Maclaurin, George Necula, Adam Paszke, Jake VanderPlas, Skye Wanderman-Milne, and Qiao Zhang, “JAX: composable transformations of Python+NumPy programs,” (2018)

    work page 2018

  47. [47]

    Quantum generative adversarial learning,

    Seth Lloyd and Christian Weedbrook, “Quantum generative adversarial learning,” Physical Review Letters 121, 040502 (2018)

    work page 2018

  48. [48]

    Quantum computing with differentiable quantum transforms,

    Olivia Di Matteo, Josh Izaac, Tom Bromley , Anthony Hayes, Christina Lee, Maria Schuld, Antal Száva, Chase Roberts, and Nathan Killoran, “Quantum computing with differentiable quantum transforms,” arXiv preprint arXiv:2202.13414 (2022)

    work page arXiv 2022

  49. [49]

    thesis, Harvard University , Graduate School of Arts & Sciences (2016)

    Dougal Maclaurin, Modeling, inference and optimization with composable differentiable procedures , Ph.D. thesis, Harvard University , Graduate School of Arts & Sciences (2016)

    work page 2016

  50. [50]

    Automatic differen- tiation in machine learning: a survey

    Atılım Güne¸ s Baydin, Barak A Pearlmutter, Alexey Andreye- vich Radul, and Jeffrey Mark Siskind, “Automatic differen- tiation in machine learning: a survey .” Journal of Machine Learning Research 18, 1–153 (2018)

    work page 2018

  51. [51]

    The theory of variational hybrid quantum-classical algorithms,

    Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics 18, 023023 (2016)

    work page 2016

  52. [52]

    The expressive power of parameterized quantum cir- cuits,

    Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, and Dacheng Tao, “The expressive power of parameterized quantum cir- cuits,” arXiv preprint (2018), arxiv:1810.11922

    work page arXiv 2018

  53. [53]

    Towards quantum machine learning with tensor networks,

    William Huggins, Piyush Patel, K Birgitta Whaley , and E Miles Stoudenmire, “Towards quantum machine learning with tensor networks,” arXiv preprint (2018), arxiv:1803.11537

    work page arXiv 2018

  54. [54]

    PennyLane,

    Xanadu Inc., “PennyLane,” (2018)

    work page 2018

  55. [55]

    Jones and J

    Tyson Jones and Julien Gacon, “Efficient calculation of gra- dients in classical simulations of variational quantum algo- rithms,” arXiv preprint arXiv:2009.02823 (2020)

    work page arXiv 2009

  56. [56]

    Evaluating analytic gradients on quan- tum hardware,

    Maria Schuld, Ville Bergholm, Christian Gogolin, Josh Izaac, and Nathan Killoran, “Evaluating analytic gradients on quan- tum hardware,” Physical Review A 99, 032331 (2019)

    work page 2019

  57. [57]

    General parameter-shift rules for quantum gradients,

    David Wierichs, Josh Izaac, Cody Wang, and Cedric Yen-Yu Lin, “General parameter-shift rules for quantum gradients,” Quantum 6, 677 (2022)

    work page 2022

  58. [58]

    Practical optimization for hybrid quantum-classical algorithms

    Gian Giacomo Guerreschi and Mikhail Smelyanskiy , “Prac- tical optimization for hybrid quantum-classical algorithms,” arXiv preprint (2017), arxiv:1701.01450

    work page Pith review arXiv 2017

  59. [59]

    Measuring analytic gradients of general quantum evolution with the stochastic parameter shift rule,

    Leonardo Banchi and Gavin E Crooks, “Measuring analytic gradients of general quantum evolution with the stochastic parameter shift rule,” Quantum 5, 386 (2021)

    work page 2021

  60. [60]

    Qiskit Backend Specifications for OpenQASM and OpenPulse Experiments

    David C McKay , Thomas Alexander, Luciano Bello, Michael J Biercuk, Lev Bishop, Jiayin Chen, Jerry M Chow, Antonio D Córcoles, Daniel Egger, Stefan Filipp, et al., “Qiskit backend specifications for openqasm and openpulse experiments,” arXiv preprint arXiv:1809.03452 (2018)

    work page Pith review arXiv 2018

  61. [61]

    PennyLane Qiskit plugin,

    Xanadu Inc., “PennyLane Qiskit plugin,” (2019)

    work page 2019

  62. [62]

    Stokes, J

    James Stokes, Josh Izaac, Nathan Killoran, and Giuseppe Carleo, “Quantum natural gradient,” arXiv preprint arXiv:1909.02108 (2019)

    work page arXiv 1909

  63. [63]

    Structure optimization for parameterized quan- tum circuits,

    Mateusz Ostaszewski, Edward Grant, and Marcello Benedetti, “Structure optimization for parameterized quan- tum circuits,” Quantum 5, 391 (2021)

    work page 2021

  64. [64]

    Operator sampling for shot-frugal optimization in variational algorithms,

    Andrew Arrasmith, Lukasz Cincio, Rolando D Somma, and Patrick J Coles, “Operator sampling for shot-frugal optimization in variational algorithms,” arXiv preprint arXiv:2004.06252 (2020)

    work page arXiv 2004

  65. [65]

    Optimizing quan- tum circuits with riemannian gradient-flow,

    Roeland Wiersema and Nathan Killoran, “Optimizing quan- tum circuits with riemannian gradient-flow,” arXiv preprint arXiv:2202.06976 (2022)

    work page arXiv 2022

  66. [66]

    Differentiable quantum computational chemistry with pennylane,

    Juan Miguel Arrazola, Soran Jahangiri, Alain Delgado, Jack Ceroni, Josh Izaac, Antal Száva, Utkarsh Azad, Robert A. 18 Lang, Zeyue Niu, Olivia Di Matteo, Romain Moyard, Jay Soni, Maria Schuld, Rodrigo A. Vargas-Hernández, Teresa Tamayo-Mendoza, Cedric Yen-Yu Lin, Alán Aspuru- Guzik, and Nathan Killoran, “Differentiable quantum computational chemistry with...

    work page arXiv 2021

  67. [67]

    OpenFermion: The Electronic Structure Package for Quantum Computers

    Jarrod R McClean, Kevin J Sung, Ian D Kivlichan, Yudong Cao, Chengyu Dai, E Schuyler Fried, Craig Gidney , Bren- dan Gimby , Pranav Gokhale, Thomas Häner, et al., “Open- fermion: the electronic structure package for quantum com- puters,” arXiv:1710.07629 (2017)

    work page Pith review arXiv 2017

  68. [68]

    Pyscf: the python-based simulations of chemistry framework,

    Qiming Sun, Timothy C Berkelbach, Nick S Blunt, George H Booth, Sheng Guo, Zhendong Li, Junzi Liu, James D Mc- Clain, Elvira R Sayfutyarova, Sandeep Sharma,et al., “Pyscf: the python-based simulations of chemistry framework,” Wi- ley Interdisciplinary Reviews: Computational Molecular Sci- ence 8, e1340 (2018)

    work page 2018

  69. [69]

    Psi4: an open-source ab initio elec- tronic structure program,

    Justin M Turney , Andrew C Simmonett, Robert M Parrish, Ed- ward G Hohenstein, Francesco A Evangelista, Justin T Fer- mann, Benjamin J Mintz, Lori A Burns, Jeremiah J Wilke, Micah L Abrams, et al., “Psi4: an open-source ab initio elec- tronic structure program,” Wiley Interdisciplinary Reviews: Computational Molecular Science 2, 556–565 (2012)

    work page 2012

  70. [70]

    Psi4 1.1: An open-source elec- tronic structure program emphasizing automation, advanced libraries, and interoperability ,

    Robert M Parrish, Lori A Burns, Daniel GA Smith, Andrew C Simmonett, A Eugene DePrince III, Edward G Hohenstein, Ugur Bozkaya, Alexander Yu Sokolov, Roberto Di Remigio, Ryan M Richard, et al. , “Psi4 1.1: An open-source elec- tronic structure program emphasizing automation, advanced libraries, and interoperability ,” Journal of Chemical Theory and Computa...

    work page 2017

  71. [71]

    Nvidia/cuquantum: cuquantum v22.03.0,

    NVIDIA cuQuantum team, “Nvidia/cuquantum: cuquantum v22.03.0,” (2022)

    work page 2022

  72. [72]

    PennyLane Strawberry Fields plugin,

    Xanadu Inc., “PennyLane Strawberry Fields plugin,” (2018)

    work page 2018

  73. [73]

    A Practical Quantum Instruction Set Architecture

    Robert S Smith, Michael J Curtis, and William J Zeng, “A practical quantum instruction set architecture,” arXiv preprint arXiv:1608.03355 (2016)

    work page Pith review arXiv 2016

  74. [74]

    PennyLane Forest plugin,

    “PennyLane Forest plugin,” (2019)

    work page 2019

  75. [75]

    PennyLane Cirq plugin,

    Xanadu Inc., “PennyLane Cirq plugin,” (2019)

    work page 2019

  76. [76]

    PennyLane ProjectQ plugin,

    Xanadu Inc., “PennyLane ProjectQ plugin,” (2018)

    work page 2018

  77. [77]

    PennyLane Q# plugin,

    Xanadu Inc., “PennyLane Q# plugin,” (2019)

    work page 2019

  78. [78]

    QunaSys, “Qulacs,” (2019)

    work page 2019

  79. [79]

    PennyLane Qulacs plugin,

    Xanadu Inc., “PennyLane Qulacs plugin,” (2019)

    work page 2019

  80. [80]

    PennyLane AQT plugin,

    Xanadu Inc., “PennyLane AQT plugin,” (2019)

    work page 2019

Showing first 80 references.