相关论文: Non-Resonant Effects in Implementation of Quantum …
In this paper, we discuss the dynamical issues of quantum computation. We demonstrate that fast wave function oscillations can affect the performance of Shor's quantum algorithm by destroying required quantum interference. We also show that…
We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard…
We investigate the influence of superpositional wave function oscillations on the performance of Shor's quantum algorithm for factorization of integers. It is shown that the wave function oscillations can destroy the required quantum…
The errors caused by the transitions with large frequency offsets (nonresonant transitions) are calculated analytically for a scalable solid-state quantum computer based on a one-dimensional spin chain with Ising interactions between…
We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a…
For a one-dimensional chain of four nuclear spins (1/2) and taking into account first and second neighbor interactions among the spin system, we make the numerical simulation of Shor prime factorization algorithm of the integer number N=4…
Electron Paramagnetic Resonance experiments show that the decay of Rabi oscillations of ensembles of spin qubits depends noticeably on the microwave power and more precisely on the Rabi frequency, an effect recently called "driven…
The number of steps any classical computer requires in order to find the prime factors of an $l$-digit integer $N$ increases exponentially with $l$, at least using algorithms known at present. Factoring large integers is therefore…
Major obstacles remain to the implementation of macroscopic quantum computing: hardware problems of noise, decoherence, and scaling; software problems of error correction; and, most important, algorithm construction. Finding truly quantum…
Shor's factoring algorithm illustrates the potential power of quantum computation. Here we present and numerically investigate a proposal for a compiled version of such an algorithm based on a quantum-wire network exploiting the…
Considering its relevance in the field of cryptography, integer factorization is a prominent application where Quantum computers are expected to have a substantial impact. Thanks to Shor's algorithm this peculiar problem can be solved in…
We present a measure of quantum coherence by employing the concept of noncommutativity of operators in quantum mechanics. We analyse the behaviour of this noncommutative coherence and underline its similarities and differences with the…
Quantum simulation has the potential to be an indispensable technique for the investigation of non-perturbative phenomena in strongly-interacting quantum field theories (QFTs). In the modern quantum era, with Noisy Intermediate Scale…
With the surge of quantum computing platforms that continue to push the boundaries of capabilities of noisy intermediate-scale quantum computers, there is a growing interest in finding relevant applications and quantifying the corresponding…
We consider Shor's quantum factoring algorithm in the setting of noisy quantum gates. Under a generic model of random noise for (controlled) rotation gates, we prove that the algorithm does not factor integers of the form $pq$ when the…
Coherent control of two-level quantum systems is typically achieved using resonant driving fields, forming the basis for qubit operations. Here, we report a mechanism for inducing complete Rabi oscillations in monochromatically driven…
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…
Quantum algorithms face significant challenges due to qubit susceptibility to environmental noise, and quantum error correction typically requires prohibitive resource overhead. This paper proposes that quantum algorithms may possess…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the…