اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUniversality of Computation in Real Quantum Theory
125
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recently de La Torre et al. [1] reconstructed Quantum Theory from its local structure on the basis of local discriminability and the existence of a one-parameter group of bipartite transformations containing an entangling gate. This result relies on universality of an entangling gate for quantum computation. Here we prove universality of C-NOT with local gates for Real Quantum Theory (RQT), showing that such universality would not be sufficient for the result, whereas local discriminability and the qubit structure play a crucial role. For reversible computation, generally an extra rebit is needed for RQT. As a byproduct we also provide a short proof of universality of C-NOT for CQT.
قيم البحث
اقرأ أيضاً
I propose a new class of interpretations, {it real world interpretations}, of the quantum theory of closed systems. These interpretations postulate a preferred factorization of Hilbert space and preferred projective measurements on one factor. They g
ive a mathematical characterisation of the different possible worlds arising in an evolving closed quantum system, in which each possible world corresponds to a (generally mixed) evolving quantum state. In a realistic model, the states corresponding to different worlds should be expected to tend towards orthogonality as different possible quasiclassical structures emerge or as measurement-like interactions produce different classical outcomes. However, as the worlds have a precise mathematical definition, real world interpretations need no definition of quasiclassicality, measurement, or other concepts whose imprecision is problematic in other interpretational approaches. It is natural to postulate that precisely one world is chosen randomly, using the natural probability distribution, as the world realised in Nature, and that this worlds mathematical characterisation is a complete description of reality.
This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground-state and time-dependent density functional theory can be applied to quantum computing systems by proving the Hohenberg-Ko
hn and Runge-Gross theorems for a fermionic representation of an N qubit system. As a first demonstration of this approach, time-dependent density functional theory is used to determine the minimum energy gap Delta(N) arising when the quantum adiabatic evolution algorithm is used to solve instances of the NP-Complete problem MAXCUT. It is known that the computational efficiency of this algorithm is largely determined by the large-N scaling behavior of Delta(N), and so determining this behavior is of fundamental significance. As density functional theory has been used to study quantum systems with N ~ 1000 interacting degrees of freedom, the approach introduced in this paper raises the realistic prospect of evaluating the gap Delta(N) for systems with N ~ 1000 qubits. Although the calculation of Delta(N) serves to illustrate how density functional theory methods can be applied to problems in quantum computing, the approach has a much broader range and shows promise as a means for determining the properties of very large quantum computing systems.
We propose a hybrid quantum computing scheme where qubit degrees of freedom for computation are combined with quantum continuous variables for communication. In particular, universal two-qubit gates can be implemented deterministically through qubit-
qubit communication, mediated by a continuous-variable bus mode (qubus), without direct interaction between the qubits and without any measurement of the qubus. The key ingredients are controlled rotations of the qubus and unconditional qubus displacements. The controlled rotations are realizable through typical atom-light interactions in quantum optics. For such interactions, our scheme is universal and works in any regime, including the limits of weak and strong nonlinearities.
One of the primary motivations of the research in the field of computation is to optimize the cost of computation. The major ingredient that a computer needs is the energy to run a process, i.e., the thermodynamic cost. The analysis of the thermodyna
mic cost of computation is one of the prime focuses of research. It started back since the seminal work of Landauer where it was commented that the computer spends kB T ln2 amount of energy to erase a bit of information (here T is the temperature of the system and kB represents the Boltzmanns constant). The advancement of statistical mechanics has provided us the necessary tool to understand and analyze the thermodynamic cost for the complicated processes that exist in nature, even the computation of modern computers. The advancement of physics has helped us to understand the connection of the statistical mechanics (the thermodynamics cost) with computation. Another important factor that remains a matter of concern in the field of computer science is the error correction of the error that occurs while transmitting the information through a communication channel. Here in this article, we have reviewed the progress of the thermodynamics of computation starting from Landauers principle to the latest model, which simulates the modern complex computation mechanism. After exploring the salient parts of computation in computer science theory and information theory, we have reviewed the thermodynamic cost of computation and error correction. We have also discussed about the alternative computation models that have been proposed with thermodynamically cost-efficient.
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the Hamiltonian involve
d must have local structure, which leads to a result about eigenvalue gaps from information theory. I also improve results about simulating quantum circuits with AQC. Second, I look at classically simulating time evolution with local Hamiltonians and finding their ground state properties. I give a numerical method for finding the ground state of translationally invariant Hamiltonians on an infinite tree. This method is based on imaginary time evolution within the Matrix Product State ansatz, and uses a new method for bringing the state back to the ansatz after each imaginary time step. I then use it to investigate the phase transition in the transverse field Ising model on the Bethe lattice. Third, I focus on locally constrained quantum problems Local Hamiltonian and Quantum Satisfiability and prove several new results about their complexity. Finally, I define a Hamiltonian Quantum Cellular Automaton, a continuous-time model of computation which doesnt require control during the computation process, only preparation of product initial states. I construct two of these, showing that time evolution with a simple, local, translationally invariant and time-independent Hamiltonian can be used to simulate quantum circuits.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
