Computational power and correlation in a quantum computational tensor network
نویسندگان
چکیده
منابع مشابه
Computational power of Hamiltonians in quantum computing
error group, 54Addelman and Kempthorne, 60adiabatic, 171adiabatic quantum computing, 171adjacency matrix, 94adjoint action, 76, 90amplification, 149annihilation operator, 134annihilator, 49, 50minimal, 50Arthur-Merlin games, 147average Hamiltonian, 44average Hamiltonian theory, 44 Bloch sphere, 33Bloch vector, 33BPP, 31BQP, 30 Carathéo...
متن کاملComputational Power of Quantum vs Classical Oracles
Comparing the computational power of quantum computers vs classical computers has been extensively studied since the invention of quantum computing. A related question is whether a quantum oracle is more powerful than a classical oracle. In this paper, we examine two topics that give partial answers to this question. We show that we can imitate a polynomial number of columns of a quantum oracle...
متن کاملOn Computational Power of Quantum Branching Programs
In this paper we study a model of Quantum Branching Program (QBP) and investigate its computational power. We define several natural restrictions of a general QBP model, such as a read-once and a read-k-times QBP, noting that obliviousness is inherent in a quantum nature of such programs. In particular we show that any Boolean function can be computed deterministically (exactly) by a read-once ...
متن کاملExtracting Computational Power From Macroscopic Quantum Coherence
It is proposed that quantum computation can be implemented on the basis of macroscopic quantum coherence of a many-particle system, especially the Bose-Einstein condensates. We suggest that a qubit can be represented by the condensate order parameter though it is in general not a pure state. Since the condensate order parameter is described by a nonlinear Schrödinger equation, one may be able t...
متن کاملComputational Power of Infinite Quantum Parallelism
Recent works have independently suggested that quantum mechanics might permit procedures that fundamentally transcend the power of Turing Machines as well as of ‘standard’ Quantum Computers. These approaches rely on and indicate that quantum mechanics seems to support some infinite variant of classical parallel computing. We compare this new one with other attempts towards hypercomputation by s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2012
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.85.032338