Related papers: Quantum Accelerator Modes from the Farey Tree
Linear optics is a promising candidate to enable the construction of quantum computers. A number of quantum protocols gates based on linear optics have been demonstrated. However, it is well-known that these gates are non-deterministic and…
The problem of creating well-collimated beams of atoms escaping from a trap is studied. This problem is of high importance for the realization of atom lasers. Nonadiabatic dynamics of neutral atoms in nonuniform magnetic fields, typical of…
Algorithms are the engine for reproducible problem-solving. We present a framework automating algorithm discovery by conceptualizing them as sequences of operations, represented as tokens. These computational tokens are chained using a…
We subject a falling cloud of cold cesium atoms to periodic kicks from a sinusoidal potential created by a vertical standing wave of off-resonant laser light. By controllably accelerating the potential, we show quantum accelerator mode…
Cosmic rays are deemed to be generated by a process known as ``Fermi acceleration", in which charged particles scatter against magnetic fluctuations in astrophysical plasmas. The process itself is however universal, has both classical and…
We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods…
This extended abstract reports on on-going research on quantum algorithmic approaches to the problem of generalised tree search that may exhibit effective quantum speedup, even in the presence of non-constant branching factors. Two…
In our previous papers we were interested in making a reconstruction of quantum mechanics according to classical mechanics. In this paper we suspend this program for a while and turn our attention to a theme in the frontier of quantum…
In the semiclassical limit of open ballistic quantum systems, we demonstrate the emergence of instantaneous decay modes guided by classical escape faster than the Ehrenfest time. The decay time of the associated quasi-bound states is…
Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in $T^*V$ for some vector space $V$. KS topological recursion is a…
Quantum information can be processed using large ensembles of ultracold and trapped neutral atoms, building naturally on the techniques developed for high-precision spectroscopy and metrology. This article reviews some of the most important…
We show that the relativistic motion of a quantum system can be used to generate quantum gates. The nonuniform acceleration of a cavity is used to generate well-known two-mode quantum gates in continuous variables. Observable amounts of…
A calculational framework is proposed for phylogenetics, using nonlocal quantum field theories in hypercubic geometry. Quadratic terms in the Hamiltonian give the underlying Markov dynamics, while higher degree terms represent branching…
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The problem of determining for a given regular tree language whether…
Deadlocks occur in concurrent programs as a consequence of cyclic resource acquisition between threads. In this paper we present a novel type system that guarantees deadlock freedom for a language with references, unstructured locking…
We study electron transmission through a periodic array of quantum dots (QD) sandwiched between doped semiconductor leads. When the Fermi wavelength of tunneling electron exceeds the array lattice constant, the off-resonant per QD…
The collective modes of striped phases in a quantum Hall system are computed using the time-dependent Hartree-Fock approximation. Uniform stripe phases are shown to be unstable to the formation of modulations along the stripes, so that…
The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gutmann has demonstrated its realization by means of quantum…
In nonrelativistic limits for states labeled by minimum packets with constrained spatial spreads and over a short term, states of unconstrained quantum field theories evolve on trajectories described by Newton's equations for the $1/r^2$…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…