English
Related papers

Related papers: Entanglement and Quantum Computation

200 papers

Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…

Quantum Physics · Physics 2018-01-24 He-Liang Huang , Ashutosh K. Goswami , Wan-Su Bao , Prasanta K. Panigrahi

Quantum entanglement is an essential feature of many-body systems that impacts both quantum information processing and fundamental physics. The growth of entanglement is a major challenge for classical simulation methods. In this work, we…

Quantum Physics · Physics 2025-07-15 Qi Zhao , You Zhou , Andrew M. Childs

An outstanding problem in quantum computing is the calculation of entanglement, for which no closed-form algorithm exists. Here we solve that problem, and demonstrate the utility of a quantum neural computer, by showing, in simulation, that…

Quantum Physics · Physics 2007-05-23 E. C. Behrman , V. Chandrashekar , Z. Wang , C. K. Belur , J. E. Steck , S. R. Skinner

We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the…

Quantum Physics · Physics 2009-10-31 Artur Ekert , Richard Jozsa

For any quantum algorithm operating on pure states we prove that the presence of multi-partite entanglement, with a number of parties that increases unboundedly with input size, is necessary if the quantum algorithm is to offer an…

Quantum Physics · Physics 2009-11-07 Richard Jozsa , Noah Linden

Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speed-ups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speed-up over…

Quantum Physics · Physics 2009-10-31 Seth Lloyd

Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…

Quantum Physics · Physics 2007-05-23 Rolando D. Somma

In a quantum computation with pure states, the generation of large amounts of entanglement is known to be necessary for a speedup with respect to classical computations. However, examples of quantum computations with mixed states are known,…

Quantum Physics · Physics 2007-05-23 Animesh Datta , Guifre Vidal

It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…

Quantum Physics · Physics 2007-05-23 Eli Biham , Gilles Brassard , Dan Kenigsberg , Tal Mor

Entanglement are the non-local correlations permitted by quantum theory, believed to play a fundamental role in a quantum computer. We have investigated these correlations in a number of theoretical models for condensed matter systems. Such…

Quantum Physics · Physics 2007-05-23 Stein Olav Skrøvseth

Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…

Quantum Physics · Physics 2015-02-05 Piotr Szańkowski

In this paper I argue that entanglement is a necessary component for any explanation of quantum speedup and I address some purported counter-examples that some claim show that the contrary is true. In particular, I address Biham et al.'s…

History and Philosophy of Physics · Physics 2015-03-19 Michael E. Cuffaro

The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…

Quantum Physics · Physics 2014-06-10 A. M. Steane

Entanglement is essential for quantum computation. However, disentanglement is also necessary. It can be achieved without the need of classical operations (measurements). Two examples are analyzed: the discrete Fourier transform and error…

Quantum Physics · Physics 2009-10-30 Asher Peres

Entanglement is closely related to some fundamental features of the dynamics of composite quantum systems: quantum entanglement enhances the "speed" of evolution of certain quantum states, as measured by the time required to reach an…

Quantum Physics · Physics 2011-11-10 A. Borras , C. Zander , A. R. Plastino , M. Casas , A. Plastino

The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood…

Quantum Physics · Physics 2007-05-23 C. Di Franco , M. Paternostro , M. S. Kim

Entanglement is a non local property of quantum states which has no classical counterpart and plays a decisive role in quantum information theory. Several protocols, like the teleportation, are based on quantum entangled states. Moreover,…

Logic in Computer Science · Computer Science 2008-12-08 Simon Perdrix

Entanglement is nowadays considered as a key quantity for the understanding of correlations, transport properties, and phase transitions in composite quantum systems, and thus receives interest beyond the engineered applications in the…

Quantum Physics · Physics 2011-10-06 Malte C. Tichy , Florian Mintert , Andreas Buchleitner

The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…

Quantum Physics · Physics 2009-11-06 Arvind

Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…

Quantum Physics · Physics 2007-05-23 Vivien M Kendon , William J Munro
‹ Prev 1 2 3 10 Next ›