相关论文: Quantum Accelerator Modes from the Farey Tree
We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
Classifying phases of local quantum systems is a general problem that includes special cases such as free fermions, commuting projectors, and others. An important distinction in this classification should be made between classifying…
Probabilistic language models, e.g. those based on an LSTM, often face the problem of finding a high probability prediction from a sequence of random variables over a set of tokens. This is commonly addressed using a form of greedy decoding…
We derive a closed form expression for the quantum corrections to the kinetic energy density (KED) in the Thomas-Fermi (TF) limit of a linear potential model system in three dimensions (the Airy gas). The universality of the expression is…
While the realization of scalable quantum computation will arguably require topological stabilization and, with it, topological-hardware-aware quantum programming and topological-quantum circuit verification, the proper combination of these…
It is shown that the Weyl fractional derivative can quantize an open system. A fractional kicked rotor is studied in the framework of the fractional Schrodinger equation. The system is described by the non-Hermitian Hamiltonian by virtue of…
Conditional random field (CRF) is an important probabilistic machine learning model for labeling sequential data, which is widely utilized in natural language processing, bioinformatics and computer vision. However, training the CRF model…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
Quantum walks have been shown to have impressive transport properties compared to classical random walks. However, imperfections in the quantum walk algorithm can destroy any quantum mechanical speed-up due to Anderson localization. We…
We study the phenomenon of mode-locking in the context of quasiperiodically forced non-linear circle maps. As a main result, we show that under certain C1-open condition on the geometry of twist parameter families of such systems, the…
Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations…
Quantum $r$-Airy structures can be constructed as modules of $\mathcal{W}(\mathfrak{gl}_r)$-algebras via restriction of twisted modules for the underlying Heisenberg algebra. In this paper we classify all such higher quantum Airy structures…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…
We theoretically study the quantum speed limit of a single atom trapped in a Fabry-Perot microresonator. The cavity mode will be squeezed when a driving laser is applied to the second-order nonlinear medium, and the effective Hamiltonian…
Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…
Synchronization, a ubiquitous phenomenon in classical systems, has recently been extended to the quantum domain. Here, we show quantum synchronization of a bosonic mode exhibiting a Fock state-like limit cycle, manifesting as a steady state…
Quantum computers have leaped from the theoretical realm into a race to large-scale implementations. This is due to the promise of revolutionary speedups, where achieving such speedup requires designing an algorithm that harnesses the…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme…