New theoretical results prove Trotter error depends on diagonal BCH elements in the Hamiltonian eigenbasis, paired with O(n) compact BCH representations and software that enable accurate error estimates up to 100+ qubits.
super hub Mixed citations
PennyLane: Automatic differentiation of hybrid quantum-classical computations
Mixed citation behavior. Most common role is background (62%).
145
Pith papers citing it
Background
62% of classified citations
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.
hub tools
citation-role summary
background 16
method 10
citation-polarity summary
claims ledger
- 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 co
authors
co-cited works
representative citing papers
A fermionic permutation protocol on 2D nearest-neighbor grids achieves the optimal O(sqrt(N)) depth with O(N sqrt(N)) gates, no ancillas, and extends to Jordan-Wigner, Bravyi-Kitaev, and Parity encodings via Hilbert-curve layout.
Qvine uses vine copula-inspired quantum circuit structures to achieve linear or quadratic depth scaling for loading high-dimensional distributions with high approximation quality.
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.
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 unresolved, and 2 reversed outcomes.
A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
MetaMorphQ defines five physics-derived invariants for VQE circuits that enable oracle-free testing with zero false positives and Youden's J of 0.57 on 500 benchmarks versus 0.02 for convergence testing.
A neural network is trained to predict parameters of a fixed quantum circuit, enabling high-fidelity quantum state preparation from classical data in one inference step with up to 0.992 fidelity on unseen MNIST and Fashion-MNIST images.
A learning-based framework constructs logical operations for arbitrary quantum codes and co-designs non-additive encodings with noise models and desired gate sets via VarEFTQC.
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.
Introduces the CULT threat model with four circuit-level attacks on quantum federated learning and shows they degrade accuracy on MNIST and CIFAR-10 even when defenses like Krum are used.
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.
NVQLS introduces the first hybrid quantum-classical unsupervised operator learning method for parametric PDEs via Legendre-Galerkin weak form, sign ambiguity resolution, and neural embedding.
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.
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 classical RNNs on long-horizon solar forecasting while running on NISQ devices.
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.
The hardware-compatible Brick-Circuit generator produces quantum test states with higher expressibility and entanglement than existing generators at shallower circuit depths.
QIBP adapts interval bound propagation to quantum neural networks for certified adversarial robustness via interval and affine arithmetic implementations.
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.
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.
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.
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 fewer parameters and improved low-data regime results.
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.
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% multi-class on image datasets.
citing papers explorer
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.