相关论文: Classical computing, quantum computing, and Shor's…

In recent years, advancements in quantum chip technology, such as Willow, have contributed to reducing quantum computation error rates, potentially accelerating the practical adoption of quantum computing. As a result, the design of quantum…

Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…

Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…

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…

Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…

This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The…

In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker{\aa} so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one…

We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…

Quantum computers promise to surpass the most powerful classical supercomputers when it comes to solving many critically important practical problems, such as pharmaceutical and fertilizer design, supply chain and traffic optimization, or…

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…

Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum…

We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…

We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…

We report on the current state of factoring integers on both digital and analog quantum computers. For digital quantum computers, we study the effect of errors for which one can formally prove that Shor's factoring algorithm fails. For…

Quantum computers are considered as a part of the family of the reversible, lineary-extended, dynamical systems (Quanputers). For classical problems an operational reformulation is given. A universal algorithm for the solving of classical…

We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…

Quantum models of computation are widely believed to be more powerful than classical ones. Efforts center on proving that, for a given problem, quantum algorithms are more resource efficient than any classical one. All this, however,…

We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…

Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering computations without any fixed causal structure and showing…

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available…