相关论文: A prime factorization based on quantum dynamics on…
The possible effect of environment on the efficiency of a quantum algorithm is considered explicitely. It is illustrated through the example of Shor's prime factorization algorithm that this effect may be disastrous. The influence of…
In this sequence of papers, noncommutative analysis is used to give a consistent axiomatic approach to a unified conceptual foundation of classical and quantum physics. The present Part I defines the concepts of observables, states and…
Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for generating unbiased and independent samples from graphical models remains an active research…
A theoretical model of a quantum device which can factorize any number N in two steps i.e. by preparing an input state and performing a measurement is discussed. The analysis reveals that the duration of state preparation and measurement is…
Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods by executing quantum algorithms with tensor networks on conventional hardware. Unlike circuit models restricted to unitary gates, tensor…
Magic-angle spinning (MAS) solid state nuclear magnetic resonance (NMR) spectroscopy is shown to be a promising technique for implementing quantum computing. The theory underlying the principles of quantum computing with nuclear spin…
Open quantum systems are ubiquitous in the physical sciences, with widespread applications in the areas of chemistry, condensed matter physics, material science, optics, and many more. Not surprisingly, there is significant interest in…
Long-lived quantum memories are essential components of a long-standing goal of remote distribution of entanglement in quantum networks. These can be realized by storing the quantum states of light as single-spin excitations in atomic…
During recent years, quantum computers have received increasing attention, primarily due to their ability to significantly increase computational performance for specific problems. Computational performance could be improved for…
An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…
Quantum reservoir computing has emerged as a promising paradigm within the field of quantum machine learning, harnessing the inherent properties of quantum systems to optimise and enhance information processing capabilities. Here, we…
We solve the time-dependent Schrodinger equation for the combination of a spin system interacting with a spin bath environment. In particular, we focus on the time development of the reduced density matrix of the spin system. Under normal…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Combining quantum computers with classical compute power has become a standard means for developing algorithms that are eventually supposed to beat any purely classical alternatives. While in-principle advantages for solution quality or…
Quantum computing is an emerging field of science which will eventually lead us to new and powerful logic devices with capabilities far beyond the limits of current transistor-based technology. There are certain types of problems which…
Computational physics is an important tool for analysing, verifying, and -- at times -- replacing physical experiments. Nevertheless, simulating quantum systems and analysing quantum data has so far resisted an efficient classical treatment…
Magnetic nanoparticles and their magnetization dynamics play an important role in many applications. We focus on magnetization dynamics in large ensembles of single domain nanoparticles being characterized by either Brownian or N\'{e}el…
Feynman, in 1982, proposed the idea of using a quantum simulator to perform quantum simulations. A quantum simulator is basically a controllable quantum system that can mimic the dynamics of other quantum systems we wish to study. In this…
Shor's algorithm for the prime factorization of numbers provides an exponential speedup over the best known classical algorithms. However, nontrivial practical applications have remained out of reach due to experimental limitations. The…