REVIEW 30 cited by
Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
read the original abstract
Parameterized quantum circuits play an essential role in the performance of many variational hybrid quantum-classical (HQC) algorithms. One challenge in implementing such algorithms is to choose an effective circuit that well represents the solution space while maintaining a low circuit depth and number of parameters. To characterize and identify expressible, yet compact, parameterized circuits, we propose several descriptors, including measures of expressibility and entangling capability, that can be statistically estimated from classical simulations of parameterized quantum circuits. We compute these descriptors for different circuit structures, varying the qubit connectivity and selection of gates. From our simulations, we identify circuit fragments that perform well with respect to the descriptors. In particular, we quantify the substantial improvement in performance of two-qubit gates in a ring or all-to-all connected arrangement compared to that of those on a line. Furthermore, we quantify the improvement in expressibility and entangling capability achieved by sequences of controlled X-rotation gates compared to sequences of controlled Z-rotation gates. In addition, we investigate how expressibility "saturates" with increased circuit depth, finding that the rate and saturated-value appear to be distinguishing features of a parameterized quantum circuit template. While the correlation between each descriptor and performance of an algorithm remains to be investigated, methods and results from this study can be useful for both algorithm development and design of experiments for general variational HQC algorithms.
Forward citations
Cited by 30 Pith papers
-
The Cost of Removing Tunability in Quantum Data Re-Uploading
Fixed upload circuits approximate tunable ones to error ε with depth O_σ[(log(1/ε))^σ] for any σ>1 (improving prior polynomial bounds) and matching Ω(log(1/ε)) lower bounds for mismatch-class targets via auxiliary ext...
-
Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search
MCTS discovers superior data encoding circuits for QCCNNs that outperform standard encodings on medical datasets, with effective rank of feature maps serving as a performance predictor.
-
Beyond Gates: Pulse Level Quantum Fourier Models
Pulse-level parameterization of quantum Fourier models replaces single gate angles with multiple independent sub-angles, relaxing monomial couplings and improving gradient descent performance on Fourier series tasks.
-
The Fourier Wall: Why Public Tabular Datasets Refuse Quantum Advantage, and a Certified Recipe for Where It Lives
Quantum models beat tuned classical baselines on tabular data only when the target spectrum is off-grid, high-order, high-frequency, near-independent, and dense; SPECTRA certifies these conditions and refuses most pub...
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Gr...
-
Symmetry-adapted qubit encoding with complete active space and Bravyi--Kitaev mapping for quantum chemistry on a quantum computer
SAE-CAS reduces qubit requirements for quantum chemistry by extending symmetry-adapted mappings to frozen-core and virtual orbitals, integrates with Bravyi-Kitaev and point-group symmetries, and shows improved VQE per...
-
Accelerating physics-informed neural networks for full waveform inversion using a hybrid quantum-classical finite-basis architecture
Hybrid quantum-classical FBPINN for acoustic FWI achieves lower L1 velocity error than classical baselines in ~8x fewer iterations with ~33% fewer parameters on anomaly and checkerboard benchmarks.
-
Quantum Hierarchical Reinforcement Learning via Variational Quantum Circuits
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.
-
Quantum Tilted Loss in Variational Optimization: Theory and Applications
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 ...
-
Geometric Quantum Physics Informed Neural Network
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.
-
Scaling of Quantum Resources for Simulating a Long-Range System
Structure-aware VQE ansatze for long-range Ising models cut required circuit layers by 2.5x to 3.8x in non-local regimes while two-qubit gate counts scale quadratically with system size, consistent with the number of ...
-
Eliminating Vendor Lock-In in Quantum Machine Learning via Framework-Agnostic Neural Networks
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.
-
Ans\"atz Expressivity and Optimization in Variational Quantum Simulations of Transverse-field Ising Model Across System Sizes
VQE on TFIM up to 27 spins shows hardware-efficient ansätze optimize smoothly but under-capture entanglement, while HVA-type ansätze match ground-state structure better at higher optimization cost.
-
Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines
Survey of quantum feature encoding families with a cost-expressivity-robustness taxonomy, closed-form NISQ bounds, and a five-regime decision framework that recommends shallow angle encodings when gate error rate p is...
-
Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework
QADR decomposes n-qubit VQCs into local sub-circuits to reduce memory from O(2^n) to O(n * 2^{2d+1}) and mitigate barren plateaus, scaling to 2000 features on MNIST and wind turbine diagnostics while matching classica...
-
Quantum encodings that preserve persistent homology
Investigates which quantum encodings of classical datasets preserve persistent homology so that quantum algorithms can extract topological features directly from the data.
-
Software Between Quantum and Machine Learning -- And Down to Pulses
A JAX-based framework extending quantum machine learning to pulse-level control with composable ansatzes, end-to-end optimization, and Fourier diagnostics.
-
Large-Scale Quantum Kernels for Hyperspectral Data Classification
Simulated fidelity quantum kernels achieve competitive or better accuracy than RBF kernels on Indian Pines binary and multiclass tasks and Methane Detection data without heavy dimensionality reduction.
-
Compositional Quantum Heuristics for Max-Clique Detection
Compositional quantum circuits with symmetry-induced invariant losses produce trainable equivariant quantum GNNs that generalize on max-clique problems and improve hybrid recursive search accuracy and scalability.
-
Evaluating quantum circuits in the reservoir computing paradigm
Brickwall circuits from Haar-random, dual-unitary, and solvable two-qubit gates are tested as quantum reservoirs, showing effective fading memory and prediction accuracy on synthetic time-series data.
-
Evaluating quantum circuits in the reservoir computing paradigm
Brickwall quantum circuits with Haar-random, dual-unitary, and solvable two-qubit gates serve as effective reservoirs for temporal processing tasks, with performance correlated to circuit dynamics and validated on syn...
-
Swap Network Augmented Ans\"atze on Arbitrary Connectivity
By augmenting quantum circuit ansatze with optimized swap networks, the work achieves better performance in ground-state energy calculations using fewer resources on devices with arbitrary qubit connectivity.
-
Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation
The paper introduces Recursive QLSTM via metacore recursion, numerically tests variants on sequence lengths, and offers theoretical arguments for better temporal propagation.
-
Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines
For noisy near-term quantum devices, the paper recommends shallow angle encoding over amplitude encoding once two-qubit error rates exceed roughly 10^-3.
-
Software Between Quantum and Machine Learning -- And Down to Pulses
Introduces a JAX-based framework for pulse-level QML with composable ansatze, end-to-end pulse optimization, and Fourier-analytic diagnostics.
-
Random-State Generation and Preparation Complexity in Rydberg Atom Arrays
Random global pulses in Rydberg chains generate states with Haar-like statistics at long times for weak interactions, while optimal control prepares generic symmetric states with infidelities from 10^{-5} to 3e-2 for ...
-
Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut
Light cone cancellation decomposes VQE circuits for Max-Cut into smaller subcircuits, yielding higher approximation ratios on simulated noisy backends up to 100 qubits compared to standard VQE.
-
Ans\"atz Expressivity and Optimization in Variational Quantum Simulations of Transverse-field Ising Model Across System Sizes
VQE with EfficientSU2 and Hamiltonian Variational ansatze approximates TFIM ground states and entanglement in up to 3D lattices of 27 spins, with accuracy tied to ansatz expressivity and optimization success.
-
Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: their impact on model's accuracy
Empirical comparison of angle and amplitude encoding in VQCs on Wine and Diabetes datasets shows rotational gate selection in the encoding layer changes accuracy by 10-41 percent and treats embedding as a tunable hype...
-
A review of quantum machine learning and quantum-inspired applied methods to computational fluid dynamics
A survey of variational quantum algorithms, quantum neural networks, and tensor networks for addressing scalability challenges in computational fluid dynamics.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.