Research
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

55110164219 · Jun 202019922001200920172026
48 results for logic circuit simulation

CSM-NN uses neural networks to speed up and improve the accuracy of logic circuit simulations.

problem Inaccurate and slow simulation of complex circuits with billions of transistors.
method Current Source Model (CSM) combined with optimized neural network structures and parallel processing.
result Reduces simulation time by up to 6x on CPUs and 15x on GPUs with less than 2% error.

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.

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.

The focus of this paper is on intrinsic methods to detect overfitting. By intrinsic methods, we mean methods that rely only on the model and the training data, as opposed to traditional methods (we call them extrinsic methods) that rely on performance on a test set or on bounds from model complexity. We propose a famil…

2019-07-03abs ↗pdf ↗

Quantum tech speeds up financial risk assessment.

problem Improving credit valuation adjustments using quantum mechanics.
method Developed a quantum algorithm using Bayesian quantum amplitude estimation and engineered likelihood functions.
result Significant speedup in quantum computations for CVA over classical methods.

Quantum Signal Processing reduces derivative pricing quantum resource requirements.

problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.

We constructed an analog electrical circuit which generates fluctuations in which probability density function has power law tails. In the circuit fluctuations with an arbitrary exponent of the power law can be obtained by adjusting the resistance. With this low cost circuit the random fluctuations which have the simil…

2001-04-18abs ↗pdf ↗

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.

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 …

2018-05-22abs ↗pdf ↗

Active sampling improves design space exploration for analog circuits.

problem Efficiently exploring the space of design features in analog circuits with many parameters.
method Combining drastic dimension reduction with sensitivity analysis and Bayesian surrogate modeling for active sampling.
result The proposed active sampling flow outperforms traditional Monte-Carlo sampling.

In this paper, we firstly introduce a method to efficiently implement large-scale high-dimensional convolution with realistic memristor-based circuit components. An experiment verified simulator is adapted for accurate prediction of analog crossbar behavior. An improved conversion algorithm is developed to convert conv…

2018-09-14abs ↗pdf ↗

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.

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…

2018-08-10abs ↗pdf ↗

Compact models learn photocurrent dynamics from radiation-induced excess carrier density.

problem Accurate but computationally expensive physics-based photocurrent models for semiconductor devices.
method Dynamic Mode Decomposition (DMD) for learning reduced order models from internal state data.
result Physics-aware, compact delayed photocurrent models accurately approximate internal excess carrier dynamics.

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…

2018-04-11abs ↗pdf ↗

This work shows how to efficiently simulate parts of quantum landscapes using classical computers.

problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.

Recent years have witnessed the great success of deep neural networks in many research areas. The fundamental idea behind the design of most neural networks is to learn similarity patterns from data for prediction and inference, which lacks the ability of logical reasoning. However, the concrete ability of logical reas…

2019-10-17abs ↗pdf ↗

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.

New fault-tolerant quantum gates for homological LDPC codes with constant or almost-constant rate.

problem Fault-tolerant quantum computing for homological LDPC codes with constant or almost-constant encoding rate.
method Derive generic formula for transversal and logical gates acting on 3-manifolds, using higher symmetries and cup product cohomology.
result Parallelizable logical gates for homological LDPC codes with constant or almost-constant rate.

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 …

2019-02-19abs ↗pdf ↗

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.

VQAs use classical optimization to train quantum circuits, promising quantum advantage.

problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.

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.

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…

2019-06-30abs ↗pdf ↗

Quantum circuits represent binary classification trees with binary features.

problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.

Quantum models avoiding barren plateaus can also be efficiently simulated classically.

problem Understanding the limitations of barren plateaus in quantum computing.
method Analyzing commonly used models and their ability to be simulated classically.
result Many quantum models with barren plateau-free landscapes can also be efficiently simulated classically.

SGLBO optimizes quantum circuits with fewer measurements, improving accuracy and noise resilience.

problem Efficiently optimizing parameterized quantum circuits with reduced measurement shots and noise.
method Developed SGLBO combining SGD and BO, with adaptive measurement-shot strategy and suffix averaging.
result Significantly reduces measurement-shot cost while improving accuracy and noise resilience.

A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.

problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.

Common nonlinear activation functions used in neural networks can cause training difficulties due to the saturation behavior of the activation function, which may hide dependencies that are not visible to vanilla-SGD (using first order gradients only). Gating mechanisms that use softly saturating activation functions t…

2016-03-01abs ↗pdf ↗

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.

New method reduces uncertainty in high-dimensional circuits by automatically determining tensor rank and adaptive sampling.

problem Uncertainty quantification in high-dimensional circuits due to fabrication process variations.
method Tensor regression with q/2\ell_{q}/ \ell_{2} group-sparsity regularization for rank determination and adaptive sampling.
result Captures uncertainty with only 100-600 simulation samples for 19-100 random variables.

Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approxim…

2018-06-01abs ↗pdf ↗

Quantum computing promises faster insurance contract valuation.

problem Computational intensity of insurance contract valuation.
method Investigation of quantum computing's applicability for insurance contracts using Amplitude Estimation.
result Quantum computing can significantly speed up insurance contract valuation.

A quantum walk-based method for generating precise probability distributions efficiently.

problem Generating high-precision probability distributions for various applications.
method Integrates variational quantum circuits with split-step quantum walks to dynamically tune coin parameters and evolve quantum states.
result Achieves high simulation fidelity and reduces computational overhead compared to conventional methods.

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.

Metalearned neural circuit performs inference over open classes.

problem Nonparametric Bayesian models' practical barriers in real-world applications.
method Extract inductive bias from nonparametric Bayesian model and transfer to neural network.
result Metalearned neural circuit achieves comparable or better performance than particle filter-based methods.