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,657 papers · 148 categories

Trend · papers per month

11223344 · Jun 202019922001200920172026
48 results for quantum logic

Paper tackles interpretability issues in deep learning models.

problem Lack of understanding of deep learning models' decision-making processes.
method Integrates concepts from machine learning, quantum computation, and quantum field theory.
result Demonstrates a many valued quantum logic system in Convolutional Deep Belief Networks.

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.

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.

Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference …

2016-11-24abs ↗pdf ↗

Quantum codes linked to abelian varieties, providing mathematical rigor.

problem Quantum error correction through complex abelian varieties.
method Mathematical formulation of Gottesman-Kitaev-Preskill codes using abelian varieties.
result Asymptotic isometry of encoding, precise gate realizations, and failure probability optimization.

Study on topological order on fractal geometries, proving no-go theorem and fault-tolerant gates.

problem Investigating topological order on fractal geometries embedded in n dimensions.
method Using quantum error-correcting codes and systolic geometry to diagnose topological order.
result Proves no-go theorem for topological order on 2D fractals, survival on higher dimensions, and construction of fault-tolerant gates.

Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires O(n3)O(n^3) logic gates. We show that the quantum linear systems algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] can be applied to Gaussian process regre…

2015-12-12abs ↗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.

Optimizes train schedules and maintenance using CP and QA.

problem Optimizing train schedules and maintenance considering constraints.
method Used Constraint Programming and Quantum Annealing to model and solve the problem.
result Both CP and QA approaches produce comparable results on real quantum computers.

We introduce a differential geometric framework for describing families of quantum error-correcting codes and for understanding quantum fault tolerance. This work unifies the notion of topological fault tolerance with fault tolerance in other kinds of quantum error-correcting codes. In particular, we use fibre bundles …

2013-09-26abs ↗pdf ↗

Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.

problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.

Quantum computing offers new solutions for financial optimization, pricing, risk, and security.

problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.

Paper presents a new VMBQC model with fewer parameters for better generative modeling.

problem Limited generative power of VMBQC due to more parameters than unitary models.
method Introduces a restricted VMBQC model with a single additional trainable parameter.
result Minimal extension of VMBQC model generates distributions not learnable by unitary models.

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

problem Improving quantum error correction performance with hyperbolic lattices.
method Unified framework using Hyperbolic Cycle Basis algorithm for CSS codes construction and benchmarking.
result Achieved higher encoding rates and lower qubit overhead in hyperbolic quantum error correction codes.

GKP codes connect quantum gates to algebraic curves, enabling fault-tolerant quantum computation.

problem Implementing fault-tolerant quantum computation in quantum harmonic oscillator systems.
method Exploring the topological and algebraic structure of GKP codes, showing how gates correspond to symplectic automorphisms and mapping class groups of surfaces.
result GKP Clifford gates are identified with symplectic automorphisms of GKP lattices and mapping class groups of surfaces, providing a topological interpretation of fault tolerance.

The abstract explores a new wave equation linking quantum mechanics and complex adaptive systems.

problem Understanding the underlying mechanism of distribution formation in complex quantum entanglement.
method Exploring the logical relationship between Schrödinger's wave equation and Shi's trading volume-price wave equation in finance.
result A non-localized wave equation in quantum mechanics reveals the invariance of interaction as a universal law.

We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the pp-faces of the nn-cube (for n>pn>p) and stabilizer constraints with faces of dimension (p±1)(p\pm1). The quantum code obtained by identifying antipodal faces of the resulting complex encodes one logical qubit into $N = 2^…

2019-11-08abs ↗pdf ↗

AlphaLogics mines market logic to generate interpretable alpha factors.

problem Complex, opaque alpha factors from factor mining overlook market logic.
method Market Logic Mining, Factor Generation and Optimization, Market Logic Generation and Optimization.
result AlphaLogics improves predictive metrics and risk-adjusted returns over baselines.

Starting from the Fermat's principle of least action, which governs classical and quantum mechanics and from the theory of exterior differential forms, which governs the geometry of curved manifolds, we show how to derive the equations governing neural networks in an intrinsic, coordinate invariant way, where the loss …

2018-11-01abs ↗pdf ↗

Explaining neural network computation in terms of probabilistic/fuzzy logical operations has attracted much attention due to its simplicity and high interpretability. Different choices of logical operators such as AND, OR and XOR give rise to another dimension for network optimization, and in this paper, we study the o…

2019-01-20abs ↗pdf ↗

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.

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 ↗

Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.

problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

problem Solving Mixed Integer Programs (MIPs) efficiently.
method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.
result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.

New quantum code breaks distance barrier with transversal non-Clifford gates.

problem Breaking the sqrt(N) distance barrier for quantum LDPC codes.
method Combining three qLDPC codes, Freedman-Hastings mapping, and triple cup product.
result Achieves Ω(N^(2/3)) distance and Θ(N^(2/3)) dimension, enabling fault-tolerant magic state preparation.

The Allais and Ellsberg paradoxes show that the expected utility hypothesis and Savage's Sure-Thing Principle are violated in real life decisions. The popular explanation in terms of 'ambiguity aversion' is not completely accepted. On the other hand, we have recently introduced a notion of 'contextual risk' to mathemat…

2011-05-09abs ↗pdf ↗

The purpose of this paper is to discuss how topology and geometry provide, in many instances, the connective tissue that enables logical comprehension. We illustrate this theme with many examples including Venn diagrams, knot diagrams, knot-logical diagrams and an arrow of reference that elucidates self-reference and G…

2015-08-25abs ↗pdf ↗

D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.

problem Optimizing portfolios with constraints using hybrid quantum-classical methods.
method Operational decomposition audit of D-Wave's hybrid quantum-classical service on mean-variance-turnover instances.
result Classical decomposition and feasibility-aware reassembly are key to hybrid quantum-classical performance.

Transformers learn to predict temporal logic solutions from classical solver outputs.

problem Training neural networks on logic problem solutions for verification.
method Training a Transformer on generated training data from classical solvers, focusing on one solution per formula.
result Transformers can predict correct solutions to temporal logic problems, even to unseen benchmarks.

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

2019-07-18abs ↗pdf ↗

While neural networks are good at learning unspecified functions from training samples, they cannot be directly implemented in hardware and are often not interpretable or formally verifiable. On the other hand, logic circuits are implementable, verifiable, and interpretable but are not able to learn from training data …

2020-02-10abs ↗pdf ↗

Knowledge graph reasoning, which aims at predicting the missing facts through reasoning with the observed facts, is critical to many applications. Such a problem has been widely explored by traditional logic rule-based approaches and recent knowledge graph embedding methods. A principled logic rule-based approach is th…

2019-06-20abs ↗pdf ↗

We propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning. NLMs exploit the power of both neural networks---as function approximators, and logic programming---as a symbolic processor for objects with properties, relations, logic connectives, and quantifier…

2019-04-26abs ↗pdf ↗

Study logical generalization in GNNs using a new benchmark.

problem Understanding how GNNs adapt to new logical tasks.
method Developed GraphLog benchmark suite for logical tasks, evaluated GNNs in supervised, pretraining, and continual learning settings.
result Logical diversity during training affects GNNs' ability to generalize.

Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take consistent and robust decisions in complex environments. The integration of deep learn…

2019-01-14abs ↗pdf ↗