相关论文: Entanglement Simulations of Shor's Algorithm

Shor's algorithm is one of the most important quantum algorithm proposed by Peter Shor [Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 124--134]. Shor's algorithm can factor a large integer with…

Quantum coherence constitutes a fundamental physical mechanism essential to the study of quantum algorithms. We study the coherence and decoherence in generalized Shor's algorithm where the register $A$ is initialized in arbitrary pure…

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…

These are pedagogical notes on Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time. In contrast, all known classical algorithms for the…

Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for entanglement measure defined in terms of success rate of Grover's search algorithm has…

Interaction with environment may lead to the transition of quantum system from pure state to the mixed one. In this case, the problem of definition of entanglement may arise. In particular, quantitative measure of entanglement concurrence…

Factoring integers is considered as a computationally-hard problem for classical methods, whereas there exists polynomial-time Shor's quantum algorithm for solving this task. However, requirements for running the Shor's algorithm for…

The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource…

The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…

Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both…

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…

We show that combining randomized measurement protocols with importance sampling allows for characterizing entanglement in significantly larger quantum systems and in a more efficient way than in previous work. A drastic reduction of…

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…

Traditionally, quantum entanglement has played a central role in foundational discussions of quantum mechanics. The measurement of correlations between entangled particles can exhibit results at odds with classical behavior. These…

The problem of the relationship between entanglement and two-qubit systems in which it is embedded is central to the quantum information theory. This paper suggests that the concurrence hierarchy as an entanglement measure provides an…

Quantum entanglement is a concept commonly used with reference to the existence of certain correlations in quantum systems that have no classical interpretation. It is a useful resource to enhance the mutual information of memory channels…

The aim of this work is to show a brand-new way of making deterministic Quantum Computing (short QC), in the sense of Theory of Calculability, by meaning of unitary evolution. We start from the original Shor's Algorithm to explain how the…

Recently Galv\~{a}o and Hardy have shown that quantum cloning can improve the performance of some quantum computation tasks. However such performance enhancement is possible only if quantum correlations survive the cloning process. We…

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…

In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of this limitation on the model of computation, various important…