相关论文: Quantum Accelerator Modes from the Farey Tree
We study languages and formal power series associated to (variants of) Hammersley's process. We show that the ordinary Hammersley process yields a regular language and the Hammersley tree process yields deterministic context-free (but…
We propose a method of accelerating the speed of evolution of an open system by an external classical driving field for a qubit in a zero-temperature structured reservoir. It is shown that, with a judicious choice of the driving strength of…
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free…
Given $x, y$ on an unweighted undirected graph $G$, the goal of the pathfinding problem is to find an $x$-$y$ path. In this work, we first construct a graph $G$ based on welded trees and define a pathfinding problem in the adjacency list…
We propose a new formalism for quantum field theory which is neither based on functional integrals, nor on Feynman graphs, but on marked trees. This formalism is constructive, i.e. it computes correlation functions through convergent rather…
We review recent advances in the study of nonlinear dynamics in mode-locked fibre lasers operating in the breathing (pulsating) soliton regime. Leveraging advanced diagnostics and control strategies -- including genetic algorithms -- we…
Linear algebra computations are foundational for neural networks and machine learning, often handled through arrays. While many functional programming languages feature lists and recursion, arrays in linear algebra demand constant-time…
The concept of quantum-mechanical nematic order, which is important in systems such as superconductors, is based on an analogy to classical liquid crystals, where order parameters are obtained through orientational expansions. We generalize…
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 Neural Networks (QNNs) have been recently proposed as generalizations of classical neural networks to achieve the quantum speed-up. Despite the potential to outperform classical models, serious bottlenecks exist for training QNNs;…
The emergence of Quantum Machine Learning (QML) to enhance traditional classical learning methods has seen various limitations to its realisation. There is therefore an imperative to develop quantum models with unique model hypotheses to…
Particle tracking codes are one of the fundamental tools used in the design and the study of complex magnetic lattices in accelerator physics. For most practical applications, non-linear lenses are included and the Courant-Snyder formalism…
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
We formulate a general method for the study of semiclassical-like dynamics in stable regions of a mixed phase-space, in order to theoretically study the dynamics of quantum accelerator modes. In the simplest case, this involves determining…
The understanding of how classical dynamics can emerge in closed quantum systems is a problem of fundamental importance. Remarkably, while classical behavior usually arises from coupling to thermal fluctuations or random spectral noise, it…
We introduce a new, large class of continued fraction algorithms producing what are called contracted Farey expansions. These algorithms are defined by coupling two acceleration techniques -- induced transformations and contraction -- in…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
A new approach to extraction of quantum vacuum energy, in the context of the accelerated expansion, is proposed, and it is shown that experimentally realistic orders of values can be derived. The idea has been implemented in the framework…
We give a quantum algorithm for evaluating a class of boolean formulas (such as NAND trees and 3-majority trees) on a restricted set of inputs. Due to the structure of the allowed inputs, our algorithm can evaluate a depth $n$ tree using…