English
Related papers

Related papers: The elusive source of quantum effectiveness

200 papers

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

We present here an overview of our work concerning entanglement properties of composite quantum systems. The characterization of entanglement, i.e. the possibility to assert if a given quantum state is entangled with others and how much…

Quantum Physics · Physics 2007-05-23 K. Eckert , O. Gühne , F. Hulpke , P. Hyllus , J. Korbicz , J. Mompart , D. Bruß , M. Lewenstein , A. Sanpera

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for…

Quantum Physics · Physics 2015-05-19 D. Bruß , C. Macchiavello

The role of entanglement and quantum correlations in complex physical systems and quantum information processing devices has become a topic of intense study in the past two decades. In this work we present new tools for learning about…

Quantum Physics · Physics 2017-03-01 Michel Boyer , Aharon Brodutch , Tal Mor

Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…

Quantum Physics · Physics 2009-04-04 Giuliano Benenti

We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…

Quantum Physics · Physics 2009-11-15 Atul Kumar , Mangala Sunder Krishnan

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

Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the…

Quantum Physics · Physics 2019-03-08 Ye-Chao Liu , Jiangwei Shang , Xiangdong Zhang

Typical elements of quantum networks are made by identical systems, which are the basic particles constituting a resource for quantum information processing. Whether the indistinguishability due to particle identity is an exploitable…

Quantum Physics · Physics 2018-06-18 Rosario Lo Franco , Giuseppe Compagno

A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…

Quantum Physics · Physics 2007-05-23 Robert Raussendorf , Hans J. Briegel

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

In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and…

Quantum Physics · Physics 2013-02-20 Szilárd Szalay

Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However,…

Quantum correlations have been pointed out as the most likely source of the speed-up in quantum computation. Here we analyzed the presence of quantum correlations in the implementation of Deutsch-Jozsa algorithm running in the DQC1 and DQCp…

Quantum Physics · Physics 2015-08-13 Marcio M. Santos , Eduardo I. Duzzioni

We demonstrate that, in the case of Shor's algorithm for factoring, highly mixed states will allow efficient quantum computation, indeed factorization can be achieved efficiently with just one initial pure qubit and a supply of initally…

Quantum Physics · Physics 2009-11-07 S. Parker , M. B. Plenio

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

Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…

Quantum Physics · Physics 2023-03-22 Christian Carisch , Oded Zilberberg

Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of…

Quantum Physics · Physics 2021-05-12 Tristan Kraft , Cornelia Spee , Xiao-Dong Yu , Otfried Gühne

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…

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…

Quantum Physics · Physics 2007-05-23 Arvind , N. Mukunda
‹ Prev 1 2 3 10 Next ›