Related papers: Coherence and entanglement dynamics in Shor's algo…
Simulating quantum systems constructively furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this letter, we directly simulate and explore the entanglement structure present in a…
When considered as orthogonal bases in distinct vector spaces, the unit vectors of polarization directions and the Laguerre-Gaussian modes of polarization amplitude are inseparable, constituting a so-called classical entangled light beam.…
Evolution of entanglement with the processing of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
We firstly investigate the multipartite entanglement features of the quantum states, including the iteration states achieved by repeated application of Grover iteration and the Oracle ones into which the above iteration states evolve by…
Calibrating the role of entanglement in quantum algorithms is a crucial task in the development of quantum computing. Most existing studies have primarily focused on how the static properties of entanglement-such as its magnitude and…
The question of which resources drive the advantages in quantum algorithms has long been a fundamental challenge. While entanglement and coherence are critical to many quantum algorithms, our results indicate that they do not fully explain…
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model provides a means for small capacity quantum computers to work together in such a way as to simulate a large…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these…
Evolution of entanglement with the proceeding of quantum algorithms affects the outcome of the algorithm. Particularly, the performance of Grover's search algorithm gets worsened if the initial state of the algorithm is an entangled one.…
Coherence, discord and geometric measure of entanglement are important tools for measuring physical resources. We compute them at every steps of the Grover's algorithm. We summarize these resources's patterns of change. These resources are…
Quantum entanglement and coherence are crucial resources in quantum information theory. In some scenarios, however, it is not necessary to directly estimate entanglement or coherence measures to quantify the capabilities of a state in…
With the advancement of quantum technologies, there is a potential threat to traditional encryption systems based on integer factorization. Therefore, developing techniques for accurately measuring the performance of associated quantum…
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical…
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…
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…
This paper aims to determine the exact success probability at each step of Shor's algorithm. Although the literature usually provides a lower bound on this probability, we present an improved bound. The derived formulas enable the…
Shor's quantum factoring algorithm finds the prime factors of a large number exponentially faster than any other known method a task that lies at the heart of modern information security, particularly on the internet. This algorithm…
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…
We investigate how to attack Shor's quantum algorithm for factorization with an entangling probe. We show that an attacker can steal an exact solution of Shor's algorithm outside an institute where the quantum computer is installed if he…
We propose two algorithms to factor numbers using Gauss sums and entanglement: (i) in a Shor-like algorithm we encode the standard Gauss sum in one of two entangled states and (ii) in an interference algorithm we create a superposition of…