Machine learning the dimension of a Fano variety
- URL: http://arxiv.org/abs/2309.05473v1
- Date: Mon, 11 Sep 2023 14:13:30 GMT
- Title: Machine learning the dimension of a Fano variety
- Authors: Tom Coates, Alexander M. Kasprzyk, Sara Veneziale
- Abstract summary: We show that a simple feed-forward neural network can determine the dimension of X.
We also give positive evidence for the conjecture that the quantum period of a Fano variety determines that variety.
- Score: 49.1574468325115
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Fano varieties are basic building blocks in geometry - they are `atomic
pieces' of mathematical shapes. Recent progress in the classification of Fano
varieties involves analysing an invariant called the quantum period. This is a
sequence of integers which gives a numerical fingerprint for a Fano variety. It
is conjectured that a Fano variety is uniquely determined by its quantum
period. If this is true, one should be able to recover geometric properties of
a Fano variety directly from its quantum period. We apply machine learning to
the question: does the quantum period of X know the dimension of X? Note that
there is as yet no theoretical understanding of this. We show that a simple
feed-forward neural network can determine the dimension of X with 98% accuracy.
Building on this, we establish rigorous asymptotics for the quantum periods of
a class of Fano varieties. These asymptotics determine the dimension of X from
its quantum period. Our results demonstrate that machine learning can pick out
structure from complex mathematical data in situations where we lack
theoretical understanding. They also give positive evidence for the conjecture
that the quantum period of a Fano variety determines that variety.
Related papers
- Bosonic Quantum Computational Complexity [0.0]
We lay foundations for such a research program.
We introduce natural complexity classes and problems based on bosonic generalizations of BQP.
We show that the problem of deciding the boundedness of the spectrum of a bosonic Hamiltonian is co-NP-hard.
arXiv Detail & Related papers (2024-10-05T19:43:41Z) - Machine learning detects terminal singularities [49.1574468325115]
Q-Fano varieties are positively curved shapes which have Q-factorial terminal singularities.
Despite their importance, the classification of Q-Fano varieties remains unknown.
In this paper we demonstrate that machine learning can be used to understand this classification.
arXiv Detail & Related papers (2023-10-31T13:51:24Z) - Completeness of qufinite ZXW calculus, a graphical language for
finite-dimensional quantum theory [0.11049608786515838]
We introduce the qufinite ZXW calculus - a graphical language for reasoning about finite-dimensional quantum theory.
We prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form.
Our work paves the way for a comprehensive diagrammatic description of quantum physics, opening the doors of this area to the wider public.
arXiv Detail & Related papers (2023-09-22T17:23:58Z) - Groupoid and algebra of the infinite quantum spin chain [0.0]
We show how these algebras naturally arise in the Schwinger description of the quantum mechanics of an infinite spin chain.
In particular, we use the machinery of Dirac-Feynman-Schwinger states developed in recent works to introduce a dynamics based on the modular theory by Tomita-Takesaki.
arXiv Detail & Related papers (2023-02-02T12:24:23Z) - Near-term quantum algorithm for computing molecular and materials
properties based on recursive variational series methods [44.99833362998488]
We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices.
We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
arXiv Detail & Related papers (2022-06-20T16:33:23Z) - Why we should interpret density matrices as moment matrices: the case of
(in)distinguishable particles and the emergence of classical reality [69.62715388742298]
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs)
We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way.
We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
arXiv Detail & Related papers (2022-03-08T14:47:39Z) - Machine Learning approach to the Floquet--Lindbladian problem [0.0]
We try to find a Lindbladian which generates an evolution identical -- when monitored at discrete instances of time -- to the one induced by a quantum map.
We use different Machine Learning methods as a tool to check the hypothesis that the answer to the question is encoded in spectral properties of the so-called Choi matrix.
The outcome of our experiment is that, for a given map, the property of being generated by a time-independent Lindbladian is encoded both in the eigenvalues and the eigenstates of the corresponding Choi matrix.
arXiv Detail & Related papers (2022-01-01T22:36:15Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Time and Evolution in Quantum and Classical Cosmology [68.8204255655161]
We show that it is neither necessary nor sufficient for the Poisson bracket between the time variable and the super-Hamiltonian to be equal to unity in all of the phase space.
We also discuss the question of switching between different internal times as well as the Montevideo interpretation of quantum theory.
arXiv Detail & Related papers (2021-07-02T09:17:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.