相关论文: Quantum Chaos and Quantum Algorithms
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
As quantum hardware increases in complexity, successful algorithmic execution relies more heavily on awareness of existing device constraints. In this work we focus on the problem of routing quantum information across the machine to…
Errors in quantum computers are of two kinds: sudden perturbations to isolated qubits, and slow random drifts of all the qubits. The latter may be reduced, but not eliminated, by means of symmetrization, namely by using many replicas of the…
We discuss the performance of the Search and Fourier Transform algorithms on a hybrid computer constituted of classical and quantum processors working together. We show that this semi-quantum computer would be an improvement over a pure…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
We investigate signatures of quantum chaos in the mixed-field quantum Ising model on finite-size Erd\H{o}s-R\'enyi graphs using probes scalable on near-term quantum devices. By tuning the graph connectivity, the system exhibits a crossover…
As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small,…
The relations between quantum coherence and quantum interference are discussed. A general method for generation of quantum coherence through interference-induced state selection is introduced and then applied to `simple' atomic systems…
The method of restricted path integrals allows one to effectively consider continuous (prolonged in time) measurements of quantum systems. Monitoring of the system coordinates is such a continuous measurement that allows one to describe a…
The presence of quantum chaos in nuclear mass systematics is analyzed by considering the differences between measured and calculated nuclear masses as a time series described by the power law 1/ f^alpha. While for the liquid droplet model…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
Quantum small-worlds are quantum many-body systems that interpolate between completely ordered (nearest-neighbour, next-to-nearest-neighbour etc.) and completely random interactions. As such, they furnish a novel new laboratory to study…
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
Using one-dimensional spin-1/2 systems as prototypes of quantum many-body systems, we study the emergence of quantum chaos. The main purpose of this work is to answer the following question: how does the spin-orbit interaction, as a pure…
This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
Transmon qubits arise from the quantization of nonlinear resonators, systems that are prone to the buildup of strong, possibly chaotic, fluctuations. Such instabilities will likely affect fast gate operations which involve the transient…
Merging disciplines has led to incredible learnings and breakthroughs throughout history, including the discovery of quantum computing: a cross between computation and quantum physics. In this paper, I will discuss how we can cross quantum…