相关论文: On Non Efficiency of Quantum Computer

Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…

We analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography:…

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…

In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…

We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…

It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the…

We develop a classical model of computation (the S model) which captures some important features of quantum computation, and which allows to design fast algorithms for solving specific problems. In particular, we show that Deutsch's problem…

A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum…

The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…

We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…

Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memory accesses and accesses to each list). The…

The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…

The quantum computer algorithm by Peter Shor for factorization of integers is studied. The quantum nature of a QC makes its outcome random. The output probability distribution is investigated and the chances of a successful operation is…

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…

Shor's powerful quantum algorithm for factoring represents a major challenge in quantum computation and its full realization will have a large impact on modern cryptography. Here we implement a compiled version of Shor's algorithm in a…

Quantum computer is the key to controlling complex processes. If its hardware, in general is successfully created on the basis of the physical baggage of the 20th century, the mathematical software is fundamentally lagging behind. Feynman's…

Quantum computation in molecular magnets is studied by solving the time-dependent Schr\"{o}dinger equation numerically. Following Leuenberger and Loss (Nature (London) 410, 789(2001)), an external oscillating magnetic field is applied to…

The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…

The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…

This PhD thesis explores the potential of quantum computing to address computational challenges in high-energy physics (HEP). As the Standard Model (SM) leaves key questions unanswered and no signs of new physics have emerged since the…