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

152305457609 · Jun 202019922001200920172026
48 results for magic state injection

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.

Minimal triangulations for 229 hyperbolic census knots discovered.

problem Finding minimal triangulations for hyperbolic census knots.
method Ideal triangulations of the magic manifold, low-complexity triangulations for partial fillings, sorting into families.
result Minimal triangulations for 229 hyperbolic census knots discovered, conjectured to be minimal for all 42 families.

By formulating N = 1, 2, 4, 8, D = 3, Yang-Mills with a single Lagrangian and single set of transformation rules, but with fields valued respectively in R,C,H,O, it was recently shown that tensoring left and right multiplets yields a Freudenthal-Rosenfeld-Tits magic square of D = 3 supergravities. This was subsequently…

2013-12-23abs ↗pdf ↗

Gringotts Wizarding Bank is well known as the only financial institution in all of the Wizarding UK as documented in the works recounting the heroics of Harry Potter. The concentration of power and wealth in this single bank needs to be weighed against the financial stability of the entire Wizarding economy. This study…

2017-03-30abs ↗pdf ↗

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.

We investigate nonintegrable Riemannian geometries modelled after certain symmetric spaces related to the Freudenthal-Tits Magic Square. The collection of four such structures found by Nurowski is extended by further eight. A focus is given to those admitting a compatible connection with completely skew torsion.

2008-10-12abs ↗pdf ↗

Unified framework for imputation and prediction in healthcare time series.

problem Time misalignment and data sparsity in healthcare time series.
method MAGIC (Multi-tAsk Gaussian Process for Imputation and Classification) using hierarchical multi-task Gaussian process and functional logistic regression.
result Superior predictive accuracy compared to existing methods in two healthcare applications.

We connect the algebraic geometry and representation theory associated to Freudenthal's magic square. We give unified geometric descriptions of several classes of orbit closures, describing their hyperplane sections and desingularizations, and interpreting them in terms of composition algebras. In particular, we show h…

1999-08-10abs ↗pdf ↗

Researchers create coordinates for hyperbolic surfaces, proving a magic formula.

problem Constructing coordinates for hyperbolic structures on genus-2 surfaces.
method Developed Fenchel-Nielsen coordinates and Wolpert's magic formula analogues.
result Found Darboux charts for the Goldman symplectic form on branched hyperbolic structures.

In this note, we use Chern's magic form ΦkΦ_k in his famous proof of the Gauss-Bonnet theorem to define a mass for asymptotically flat manifolds. It turns out that the new defined mass is equivalent to the one that we introduced recently by using the Gauss-Bonnet-Chern curvature LkL_k. Moreover, this equivalence implie…

2015-10-11abs ↗pdf ↗

We consider a hyperbolic surface bundle over the circle with the smallest known volume among hyperbolic manifolds having 3 cusps, so called "the magic manifold". We compute the entropy function on the fiber face of the unit ball with respect to the Thurston norm, determine homology classes whose representatives are gen…

2008-12-25abs ↗pdf ↗

We give a computer free proof of the Deligne, Cohen and deMan formulas for the dimensions of the irreducible gg-modules appearing in the tensor powers of gg, where gg ranges over the exceptional complex simple Lie algebras. We give additional dimension formulas for the exceptional series, as well as uniform dimensio…

2001-07-04abs ↗pdf ↗

We study the magic manifold NN which is a hyperbolic and fibered 33-manifold. We give an explicit construction of a fiber FaF_a and its monodromy :FaFa:F_a \rightarrow F_a of the fibration associated to each fibered class aa of NN. Let δgδ_g (resp. δg+δ_g^+) be the minimal dilatation of pseudo-Anosovs (resp. pseudo-Ano…

2014-12-24abs ↗pdf ↗

A soap film is actually a thin solid fluid bounded by two surfaces of opposite orientation. It is natural to model the film using one polyhedron for each side. Two problems are to get the polyhedra for both sides to be in the same place without canceling each other out and to model triple junctions without introducing …

2004-01-03abs ↗pdf ↗

The split version of the Freudenthal-Tits magic square stems from Lie theory and constructs a Lie algebra starting from two split composition algebras [3, 17, 18]. The geometries appearing in the second row are Severi-Brauer varieties [20]. We provide an easy uniform axiomatization of these geometries and related ones,…

2012-06-14abs ↗pdf ↗

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.

Study of skein modules in 3-manifolds, showing non-injectivity results.

problem Understanding skein modules in 3-manifolds and their behavior under gluing.
method Extended Kauffman bracket skein modules to 3-manifolds with marking, introduced new maps and studied their properties.
result Non-injectivity of certain maps in stated skein modules, especially when quantum parameter is a root of 1.

By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually constructible shapes remains however a challenging task, that we tackle by first reducing …

2014-01-15abs ↗pdf ↗

Historically, games of all kinds have often been the subject of study in scientific works of Computer Science, including the field of machine learning. By using machine learning techniques and applying them to a game with defined rules or a structured dataset, it's possible to learn and improve on the already existing …

2018-10-08abs ↗pdf ↗

Topological methods improve neuron analysis and tracer injection summary.

problem Traditional methods fail to capture the tree-like structure of neurons.
method Discrete Morse (DM) Theory for neuron skeletonization and consensus tree summarization.
result Significant performance improvements over non-topological methods.

This work estimates edge weights of edge-reinforced random walks using observed data.

problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.

Natural gradient descent avoids the magic of model parametrization, leading to different optimization outcomes.

problem Understanding the impact of model parametrization on optimization and generalization in deep learning.
method Characterization of natural gradient flow in deep linear networks and nonlinear neural networks.
result Natural gradient descent fails to generalize in some cases, while gradient descent with the right architecture performs well.

Real-world graph applications, such as advertisements and product recommendations make profits based on accurately classify the label of the nodes. However, in such scenarios, there are high incentives for the adversaries to attack such graph to reduce the node classification performance. Previous work on graph adversa…

2019-09-14abs ↗pdf ↗

Noise in RNNs promotes flatter minima and more stable dynamics.

problem Understanding and optimizing the training of RNNs with noise.
method Formalizing RNNs as stochastic differential equations and analyzing the effect of noise in the hidden states.
result Noise injection in RNNs leads to flatter minima, more stable dynamics, and improved robustness.

Noise injection improves inference privacy in DNN models.

problem Malicious servers can infer sensitive attributes from input data.
method Adaptive Noise Injection (ANI) using a lightweight DNN on the client.
result Significant improvement in privacy (up to 48.5% degradation in sensitive-task accuracy with <1% degradation in primary accuracy).

Injectivity of ReLU networks studied using statistical physics.

problem When can the input of a ReLU neural network be inferred from its output?
method Connection to spherical integral geometry and statistical physics.
result Replica symmetry-breaking theory and Gordon's min--max theorem provide insights into the injectivity threshold.

This paper contains a generalization of the convex ideal case of the Thurston-Andreev theorem when the genus is greater than 1. The heart of the paper concerns taking formal angle data on a surface and ``conformally flowing'' this formal angle data to uniquely associated uniform angle data. This flow turns out to be th…

2000-02-17abs ↗pdf ↗

This paper optimizes tracking portfolios in incomplete markets using reinforcement learning.

problem Optimizing tracking portfolios in incomplete markets with capital injection.
method Reinforcement learning approach for optimal control in reflected diffusion processes.
result Satisfactory performance of the q-learning algorithm in numerical examples.

The paper extends Merton's problem by adding benchmark tracking, finding optimal strategies.

problem Maximizing consumption utility with a trade-off against benchmark performance.
method Developed a convex duality theorem and derived optimal strategies for specific cases.
result Found optimal portfolio and consumption strategies for CRRA utility and geometric Brownian motion benchmarks.

We propose studies of special Riemannian geometries with structure groups H1=SO(3)SO(5)H_1=SO(3)\subset SO(5), H2=SU(3)SO(8)H_2=SU(3)\subset SO(8), H3=Sp(3)SO(14)H_3=Sp(3)\subset SO(14) and H4=F4SO(26)H_4=F_4\subset SO(26) in respective dimensions 5, 8, 14 and 26. These geometries, have torsionless models with symmetry groups G1=SU(3)G_1=SU(3), $G_2=SU(3)\times SU(3)…

2006-03-28abs ↗pdf ↗

A single qubit may be represented on the Bloch sphere or similarly on the 33-sphere S3S^3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 33-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-value…

2018-02-12abs ↗pdf ↗