Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “circuit learning”
Quantum circuit Born machines are generative models which represent the probability distribution of classical dataset as quantum pure states. Computational complexity considerations of the quantum sampling problem suggest that the quantum circuits exhibit stronger expressibility compared to classical neural networks. O…
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Quantum circuits are hard to learn on average.
problem Learning the output distributions of quantum circuits is hard.
method Statistical query model analysis.
result Learning quantum circuits requires exponentially many queries.
Single T-gate makes distribution learning hard for deep circuits.
problem Learning probability distributions from quantum circuits.
method Characterization of learnability and simulatability of quantum circuit outputs.
result Injection of a single T-gate into depth n^Ω(1) circuits makes distribution learning hard.
Study shows limitations and possibilities of learning quantum circuit output distributions.
problem Learnability of output distributions of local quantum circuits.
method Investigated within two oracle models: statistical query model and direct sample access model.
result Output distributions of super-logarithmic depth Clifford circuits are not efficiently learnable in the statistical query model.
Superconducting circuit technologies have recently achieved quantum protocols involving closed feedback loops. Quantum artificial intelligence and quantum machine learning are emerging fields inside quantum technologies which may enable quantum devices to acquire information from the outer world and improve themselves …
In this work, a machine learning approach for identifying the multi-omics metabolic regulatory control circuits inside the pathways is described. Therefore, the identification of bacterial metabolic pathways that are more regulated than others in term of their multi-omics follows from the analysis of these circuits . T…
The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. How…
Quantum variational circuits improve reinforcement learning efficiency.
problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …
We propose a neural information processing system which is obtained by re-purposing the function of a biological neural circuit model, to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce Neuronal Circuit Policies (NCPs), defined as…
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
Quantum neural tangent kernels help understand variational quantum circuits in machine learning.
problem Designing and predicting performance of variational quantum circuits.
method Using quantum neural tangent kernels and dynamical equations for loss functions.
result Analytical solutions for training dynamics in variational quantum circuits.
The statistical complexity of quantum circuits is studied using Rademacher complexity.
problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.
A quantum circuit designed for efficient statistical model preparation and training.
problem Challenges in preparing and learning statistical models on quantum processors.
method Utilizes the maximum entropy principle to design a statistics-informed parameterized quantum circuit (SI-PQC).
result Improves trainability and interpretability for learning quantum states and classical model parameters.
Quantum circuits predict volatility dynamics preserving asymmetry.
problem Modeling volatility time series with asymmetry.
method Single-qubit quantum circuit learning (QCL) applied to synthetic data generated by Rational GARCH model.
result QCL-based predictions preserve negative return-volatility correlation and anti-persistent behavior.
Study improves probabilistic circuits using transformations for better predictions.
problem Predictive limitations of probabilistic circuits in robotic scenarios.
method Integrates transformations into joint probability trees, extending their capabilities.
result Achieves higher likelihoods with fewer parameters on various data sets.
Unified framework for tractable inference scenarios in machine learning models.
problem Complex inference scenarios in machine learning models.
method Characterization of tractable modular operations over circuits and derivation of a unified framework.
result Unified framework for reasoning about tractable models.
Explaining Quantum Circuits with Shapley Values: Towards Explainable Quantum Machine Learningquant-ph
Quantum circuits explained using Shapley values for better understanding.
problem Improving the explainability of quantum machine learning circuits.
method Applying Shapley values to quantify gate importance in quantum circuits.
result Quantum circuits can be explained by their gate importance, enhancing understanding and interpretability.
Study evaluates capacity and trainability of parametrized quantum circuits.
problem Finding the best type of circuits for hybrid quantum-classical algorithms.
method Geometric structure of parameter space, effective quantum dimension, and circuit expressiveness.
result Identifies a transition in quantum geometry leading to decay of quantum natural gradient for deep circuits.
Compact semiconductor device models are essential for efficiently designing and analyzing large circuits. However, traditional compact model development requires a large amount of manual effort and can span many years. Moreover, inclusion of new physics (eg, radiation effects) into an existing compact model is not triv…
CCs learn high-dimensional distributions from heterogeneous data.
problem Learning high-dimensional distributions from heterogeneous data.
method Introducing characteristic circuits (CCs) that learn from data and use spectral domain.
result CCs outperform state-of-the-art density estimators on common benchmark data sets.
Quantum circuit models learn better with specific initialization strategies.
problem Understanding and improving the optimization landscape of IQP-based generative models.
method Proved barren plateaus for random initialization, established lower bounds, and developed data-dependent initialization.
result Data-dependent initialization leads to faster convergence and better minimums.
Bayesian approach optimizes quantum circuits for noisy hardware.
problem Optimizing parameterized quantum circuits on noisy quantum hardware.
method Reformulate classical optimisation as Bayesian posterior, combining cost function and prior distribution. Apply dimension reduction and posterior sampling strategies.
result Bayesian approach generates faster, less noisy circuits than classical methods.
Bayesian scores improve structure learning in probabilistic circuits.
problem Improper structure learning in probabilistic circuits based on heuristics.
method Developed Bayesian structure scores for deterministic PCs, using them in a greedy cutset algorithm.
result Effective protection against overfitting and fast, almost hyper-parameter-free structure learner.
The paper tests if LLMs' capabilities are executed by small subnetworks (circuits).
problem Understanding how LLMs execute their capabilities.
method Formalized criteria for circuits, developed hypothesis tests, applied to six circuits.
result Synthetic circuits align with idealized properties, while Transformer circuits vary in their alignment.
Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The gradient-free algorithm, presented as a sequence of exactly solvable …
Study detects if a circuit bounds a disc using curve intersections.
problem Determining if a circuit bounds an embedded disc.
method Analyzing the group generated by Dehn twists about curves in a circuit.
result Cycle relation between Dehn twists detects disc-boundability.
UKM framework optimizes VQCs, showing QCL performance is bounded.
problem Designing and optimizing variational quantum classifiers (VQCs).
method Unitary Kernel Method (UKM) and Variational Circuit Realization (VCR).
result QCL performance is bounded by UKM.
BOiLS optimizes circuit quality using Bayesian optimization.
problem Optimizing circuits with complex search spaces.
method Adapting Bayesian optimization to logic synthesis, using Gaussian process kernels and trust-region constrained acquisitions.
result Demonstrated superior performance in sample efficiency and QoR values.
Quantum circuits optimize financial portfolios faster than classical methods.
problem Dynamic portfolio optimization in financial markets.
method Variational Quantum Circuits for reinforcement learning.
result Quantum agents outperform classical RL models in risk-adjusted performance.
Evolutionary strategy optimizes quantum circuit design and parameters.
problem Optimizing quantum circuit design and parameters for NISQ devices.
method Simple evolutionary strategy to optimize both circuit architecture and parameters.
result Minor slowdown on actual quantum hardware compared to simulations, with insights into mutation operations.
Quantum circuits reveal pathways to dequantization in machine learning models.
problem Navigating the complex landscape of quantum machine learning models and algorithms.
method Introducing a framework connecting quantum circuit structure to function representability.
result Fundamental properties of quantum circuits determine classical simulability of models.
Deep convolutional neural networks (CNNs) have demonstrated impressive performance on visual object classification tasks. In addition, it is a useful model for predication of neuronal responses recorded in visual system. However, there is still no clear understanding of what CNNs learn in terms of visual neuronal circu…
This work uses SVM to identify track component failures in AC Track Circuits.
problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.
New algorithms save computation in agnostic learning with membership queries.
problem Efficiently learning touchstone classes with membership queries.
method Designing agnostic learning algorithms for circuits with sublinear gates.
result Agnostic learning algorithms for circuits with sublinear gates achieve significant computational savings.
This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.
problem Training quantum generative models on industrially relevant probability distributions is challenging due to high computational cost.
method Developed protocols for classical training of IQP circuits, which are hard to sample but have efficient gradient computation.
result Classically trained IQP circuits can efficiently sample from target probability distributions, demonstrating practical quantum advantage.
Deep networks can be understood as logical circuits, improving interpretability and generalization.
problem Lack of interpretability in deep neural networks.
method Hierarchical decomposition of DNN discrete classification map into logical combinations of intermediate classifiers.
result Deep networks can be interpreted as logical circuits with improved generalization.
Gradient descent optimization improved by circuit perspective.
problem Efficient training of large AI systems.
method Utilizing circuit perspective for mechanistic interpretability.
result Designing a curriculum for efficient learning.
LLMs optimize quantum circuits by iteratively improving proposals with feedback and memory traces.
problem Optimizing quantum circuits using large language models (LLMs) under black-box evaluation.
method Closed-loop, test-time optimization with LLMs, score-difference feedback, and restart-from-the-best sampling.
result The approach improves circuit synthesis performance and success rate, especially for larger qubit settings.
CREIMBO models diverse brain activity by identifying hidden neural sub-circuits and their non-stationary interactions.
problem Lack of alignment in neural recordings limits analysis of brain-wide dynamics.
method CREIMBO learns a unified model of neural dynamics by assuming multiple hidden global sub-circuits representing ensemble interactions.
result CREIMBO discovers session-specific neural ensembles and their non-stationary interactions, revealing cross-subject neural mechanisms.
Combines neural networks and logic circuits for interpretable, accurate, and cost-effective learning.
problem Lack of generalizability and interpretability in neural networks and high hardware cost in logic circuits.
method Trains a neural network, then translates it to random forests, and finally to AND-Inverter logic.
result The pipeline maintains greater accuracy and minimizes logic complexity.
COLEP improves robustness of conformal prediction via probabilistic circuits.
problem Adversarial perturbations can undermine the coverage guarantees of conformal prediction.
method COLEP uses probabilistic circuits to learn and reason about different semantic concepts, providing certifiable coverage guarantees.
result COLEP achieves higher prediction coverage and accuracy than a single model, especially with non-trivial knowledge models.
Aggregation and structural phase transitions of semiflexible polymer bundles: a braided circuit topology approachcond-mat.soft
A new approach uses circuit topology to study complex polymer interactions.
problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.
Bayesian model detects altered neural circuits in MCI patients.
problem Detecting altered neural circuits in Mild Cognitive Impairment patients.
method Hierarchical Bayesian recurrent state space model.
result Model discovers latent states predominantly observed in MCI patients.
Study bounds VAR model's circuit complexity, showing it's limited to TC^0 circuits.
problem Understanding the limitations of the Visual AutoRegressive model.
method Established circuit complexity bounds for the VAR model.
result VAR model is equivalent to a TC^0 threshold circuit with hidden dimension ≤ O(n).