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.

169,291 papers · 148 categories

Trend · papers per month

7152229 · Sep 202519922001200920182026
48 results for quantum memristors

Efficiently implements large-scale CNNs using memristors.

problem Implementing high-dimensional convolution in deep neural networks efficiently.
method Developed a method to convert CNN kernels to memristor-based circuits, optimized for accuracy and minimized error.
result 8-bit ADC/DAC is necessary to preserve software level classification accuracy in memristor-based CNNs.

Current-mode memristor crossbars enable neuromemristive systems with similar accuracy but different weight distributions.

problem Implementing weight matrices in neuromemristive systems via current-mode memristor crossbars.
method Derived theoretical results for weight range and distribution, developed a modified gradient descent rule for current-mode design, and performed behavioral simulations.
result Current-mode and voltage-mode designs achieve similar accuracy but use different feature representations.

DNPUs improve neural network performance with high-capacity nanoelectronic nodes.

problem Limited performance of single DNPUs in solving complex classification problems.
method Developed DNPUs as high-capacity neurons and implemented multi-DNPU networks.
result Feed-forward DNPU networks improve single DNPU performance from 77% to 94% test accuracy.

Neuromemristive systems (NMSs) currently represent the most promising platform to achieve energy efficient neuro-inspired computation. However, since the research field is less than a decade old, there are still countless algorithms and design paradigms to be explored within these systems. One particular domain that re…

2016-01-27abs ↗pdf ↗

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

Researchers successfully implemented quantum autoencoders using quantum adders in a cloud quantum computer.

problem Reducing resource usage in quantum computations.
method Experimental implementation of quantum autoencoders using approximate quantum adders in a cloud quantum computer.
result Experimental fidelities are in good agreement with theoretical predictions, proving the feasibility of quantum autoencoders via quantum adders.

Quantum ML promises faster data analysis but faces trainability challenges.

problem Challenges in training quantum machine learning models.
method Review of current methods and applications of quantum neural networks and quantum deep learning.
result Opportunities for quantum advantage in quantum machine learning.

QGAA learns latent quantum states, reducing errors in quantum data generation.

problem Learning latent representations for quantum data generation.
method Quantum Generative Adversarial Autoencoder (QGAA) combining QAE and QGAN.
result Average errors in energies for H2 and LiH are 0.02 Ha and 0.06 Ha respectively, demonstrating QGAA's potential.

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

Quantum Earth Mover's distance improves stability and efficiency in quantum learning.

problem Quantum learning's loss landscapes often lead to poor local minima and gradients.
method Introduced the quantum Earth Mover's (EM) distance and proposed a quantum Wasserstein generative adversarial network (qWGAN).
result The quantum EM distance makes quantum learning more stable and efficient.

Quantum machine learning models can approximate any continuous function.

problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.

Protocol for quantum reinforcement learning in various quantum systems.

problem Efficient quantum control and machine learning calculations.
method Proposes a protocol for quantum reinforcement learning in multiqubit and multilevel systems, without requiring coherent feedback.
result Protocol enables implementation in diverse quantum systems, including trapped ions and superconducting circuits.

Paper derives quantum Kolmogorov equations using nonlocal quantum mechanics.

problem Quantum finance equations derived from quantum stochastic calculus.
method Nonlocal approach to quantum mechanics for deriving equations.
result Nonlocal diffusions and quantum stochastic processes linked.

Quantum circuits learn to classify non-orthogonal quantum states.

problem Classifying non-orthogonal quantum states is crucial in quantum information.
method Trained quantum circuits using Adam optimization to discover parameters of unknown POVMs.
result Shallow quantum circuits can learn to discriminate among various quantum states with comparable performance to optimal POVMs.

We define quantum exterior product wedge_h and quantum exterior differential d_h on Poisson manifolds, of which symplectic manifolds are an important class of examples. Quantum de Rham cohomology is defined as the cohomology of d_h. We also define quantum Dolbeault cohomology. Quantum hard Lefschetz theorem is proved. …

1998-06-30abs ↗pdf ↗

Paper proposes a quantum deep clustering framework with improved performance.

problem Improving clustering performance in quantum machine learning.
method Quantum deep SVM, deep convolutional neural networks, and quantum K-Means clustering.
result The proposed quantum deep clustering framework shows significant performance gains over classical methods.

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.

Quantum reinforcement learning protocols implemented in superconducting circuits.

problem Improving quantum devices through learning processes.
method Implementation of quantum reinforcement learning protocols using superconducting circuits.
result Feasibility analysis of quantum reinforcement learning protocols in superconducting circuits.

Quantum machine learning tackles large datasets with randomized measurements.

problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.

Quantum model investigates financial derivative price dynamics with quantum interference effects.

problem Investigate quantum drift in financial derivatives using Heisenberg Equation of Motion.
method Apply geometric techniques to integrate Heisenberg Equation of Motion, model financial market as quantum observable.
result Quantum interference effects can act as drag or boost on financial returns.

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

Quantum LS-SVM simplifies matrix inversion for faster machine learning.

problem Speeding up machine learning algorithms for large datasets.
method Introduces a novel quantum algorithm using continuous variables to simplify matrix inversion in LS-SVM, and proposes a hybrid quantum-classical approach for sparse solutions.
result Quantum LS-SVM achieves exponential speed-up and can solve classically difficult tasks.

Survey on quantum computing and neural networks.

problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.

Quantum affine bundles are quantum principal bundles with affine quantum structure groups. A general theory of quantum affine bundles is presented. In particular, a detailed analysis of differential calculi over these bundles is performed, including the description of a natural differential calculus over the structure …

1999-08-10abs ↗pdf ↗

Improves VQAs by balancing classical and quantum training resources.

problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.

Machine learning, specifically LSTM, models quantum experiments efficiently.

problem Modeling complex quantum states with high-dimensional entanglement.
method Used a long short-term memory (LSTM) neural network to predict quantum experiment outcomes.
result LSTM neural networks can accurately predict quantum experiment outcomes without computing the states themselves.

Quantum models are rephrased as kernel methods, improving performance.

problem Improving quantum machine learning models by encoding data into quantum states.
method Rephrasing quantum models as kernel methods and using support vector machines.
result Kernel-based training finds better quantum models than variational circuit training.

We define quantum exterior product wedge_h and quantum exterior differential d_h on Poisson manifolds (of which symplectic manifolds are an important class of examples). Quantum de Rham cohomology, which is a deformation quantization of de Rham cohomology, is defined as the cohomology of d_h. We also define quantum Dol…

1998-04-30abs ↗pdf ↗

Unified framework combines trace-induced quantum kernels for improved machine learning models.

problem Improving performance of quantum machine learning models using trace-induced kernels.
method Developed a unified framework combining various trace-induced quantum kernels, including global fidelity and local projected kernels, as Lego kernels.
result Local projected kernels can achieve comparable performance to global fidelity kernels with fewer quantum resources.

Survey of QML applications on near-term quantum devices.

problem Achieving quantum advantage on real-world applications.
method Analysis of supervised and unsupervised techniques, including encoding, ansatz structure, error mitigation, and gradient methods.
result Current QML implementations on quantum hardware face limitations but show potential for real-world applications.