Related papers: Entanglement Simulations of Shor's Algorithm
Continuous improvements in quantum computing hardware are exposing the need for simultaneous advances in software. Large-scale implementation of quantum algorithms requires rapid and automated compilation routines such as circuit synthesis…
An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some…
The phenomenon of quantum entanglement is fundamental to the implementation of quantum computation, and requires at least two qubits for its demonstration. However, both Deutsch algorithm and Grover's search algorithm for two bits do not…
Studies about Quantum Information Theory continue actively in many research institutions. Very recently, pratical setups of large scale quantum computers are widely studied e.g. quantum repeaters, memories and processors. Entanglement…
In this work, we have been working on the concept of quantum entanglement. At first, we studied the theory of entanglement in its characterization and measurement, introducing a new scheme for detection of entanglement. The new approach…
Shor's algorithm for the prime factorization of numbers provides an exponential speedup over the best known classical algorithms. However, nontrivial practical applications have remained out of reach due to experimental limitations. The…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
For a bi-partite quantum system defined in a finite dimensional Hilbert space we investigate in what sense entanglement change and interactions imply each other. For this purpose we introduce an entanglement operator, which is then shown to…
We discuss the concept of how entanglement changes with respect to different factorizations of the total algebra which describes the quantum states. Depending on the considered factorization a quantum state appears either entangled or…
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor's quantum factorization algorithm…
Fault-tolerant quantum error correction (QEC) is crucial for unlocking the true power of quantum computers. QEC codes use multiple physical qubits to encode a logical qubit, which is protected against errors at the physical qubit level.…
Measurement of entanglement remains an important problem for quantum information. We present the design and simulation of an experimental method for entanglement estimation for a general multiqubit state. The system can be in a pure or a…
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies the separability of a general bipartite state by using the…
We characterize the multipartite entanglement of a system of n qubits in terms of the distribution function of the bipartite purity over balanced bipartitions. We search for maximally multipartite entangled states, whose average purity is…
Our investigation aims to study the specific role played by entanglement in the quantum computation process, by elaborating an entangled spin model developed within the 'hidden measurement approach' to quantum mechanics. We show that an…
We present two method for optimal entanglement concentration from pure entangled states by local actions only. However a prior knowledge of the Schmidt coefficients is required. The first method is optimally efficient only when a finite…
We analyze the effects of quantum correlations, such as entanglement and discord, on the efficiency of phase estimation by studying four quantum circuits that can be readily implemented using NMR techniques. These circuits define a standard…
Measuring entanglement is a demanding task in the field of quantum computation and quantum information theory. Recently, some authors experimentally demonstrated an embedding quantum simulator, using it to efficiently measure two-qubit…
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…