相关论文: NLTS Hamiltonians from classical LTCs

Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding…

In two recent papers [N. Aizawa, Y. Kimura, J. Segar, J. Phys. A 46 (2013) 405204] and [N. Aizawa, Z. Kuznetsova, F. Toppan, J. Math. Phys. 56 (2015) 031701], representation theory of the centrally extended l-conformal Galilei algebra with…

We analyze a general family of position-dependent mass quantum Hamiltonians which are not self-adjoint and include, as particular cases, some Hamiltonians obtained in phenomenological approaches to condensed matter physics. We build a…

Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator $T$ that is used to construct a Hamiltonian $H$ according to Feynman's prescription. Differences…

Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence of noise, in joint network-channel coding, or in…

We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no…

Large language models (LLMs) are increasingly used as generators in iterative neural architecture search (NAS), yet no formal convergence theory exists for this class of algorithms. We model iterative LLM-NAS as a parametric Cross-Entropy…

The advent of quantum computing necessitates the transition of worldwide cryptosystems to post-quantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed…

We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high probability. Our main contribution provides nearly optimal…

We construct a family of constant-rate highly-symmetric self-dual qLDPC codes on high dimensional expanders. This is the first self-dual code constructed on high dimensional expanders and also the first such code with a rich (e.g.…

We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…

Supergrid graphs contain grid graphs and triangular grid graphs as their subgraphs. The Hamiltonian cycle and path problems for general supergrid graphs were known to be NP-complete. A graph is called Hamiltonian if it contains a…

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…

The non-trivial topological features in the energy band of non-Hermitian systems provide promising pathways to achieve robust physical behaviors in classical or quantum open systems. A key topological feature, unique to non-Hermitian…

The solution of problems in physics is often facilitated by a change of variables. In this work we present neural transformations to learn symmetries of Hamiltonian mechanical systems. Maintaining the Hamiltonian structure requires novel…

Neural network decoding algorithms are recently introduced by Nachmani et al. to decode high-density parity-check (HDPC) codes. In contrast with iterative decoding algorithms such as sum-product or min-sum algorithms in which the weight of…

We explore the capability of a Large Language Model (LLM) to perform specific computations in mathematical physics: the task is to compute the coordinate Bethe Ansatz solution of selected integrable spin chain models. We select three…

In this note, we give very simple constructions of unique neighbor expander graphs starting from spectral or combinatorial expander graphs of mild expansion. These constructions and their analysis are simple variants of the constructions of…

It is shown that four-component (4C), quasi-four-component (Q4C), and exact two-component (X2C) relativistic Hartree-Fock (HF) equations can be implemented in an unified manner, by making use of the atomic nature of the small components of…

In this paper, a new two-parameter family of regularized kernels is introduced, suitable for applying high-order time stepping to N-body systems. These high-order kernels are derived by truncating a Taylor expansion of the non-regularized…