اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum computation in continuous time using dynamic invariants
102
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We show that the relaxation of adiabaticity can be achieved by processing information in the eigenlevels of a time dependent observable, namely, the dynamic invariant operator. Moreover, we derive the conditions for which the computation can be implemented by time independent as well as by adiabatically varying Hamiltonians. We illustrate our results by providing the implementation of both Deutsch-Jozsa and Grover algorithms via dynamic invariants.
قيم البحث
اقرأ أيضاً
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of speed. Othe
r types of computation using radically different architectures, including neuromorphic and quantum, promise breakthroughs in both speed and efficiency. Quantum computing exploits the coherence and superposition properties of quantum systems to explore many possible computational paths in parallel. This provides a fundamentally more efficient route to solving some types of computational problems, including several of relevance to biological simulations. In particular, optimisation problems, both convex and non-convex, feature in many biological models, including protein folding and molecular dynamics. Early quantum computers will be small, reminiscent of the early days of digital silicon computing. Understanding how to exploit the first generation of quantum hardware is crucial for making progress in both biological simulation and the development of the next generations of quantum computers. This review outlines the current state-of-the-art and future prospects for quantum computing, and provides some indications of how and where to apply it to speed up bottlenecks in biological simulation.
We study the percolation of a quantum particle on quasicrystal lattices and compare it with the square lattice. For our study, we have considered quasicrystal lattices modelled on the pentagonally symmetric Penrose tiling and the octagonally symmetri
c Ammann-Beenker tiling. The dynamics of the quantum particle is modelled using continuous-time quantum walk (CTQW) formalism. We present a comparison of the behaviour of the CTQW on the two aperiodic quasicrystal lattices and the square lattice when all the vertices are connected and when disorder is introduced in the form of disconnections between the vertices. Unlike on a square lattice, we see a significant fraction of quantum state localised around the origin in quasicrystal lattice. With increase in disorder, the percolation probability of a particle on a quasicrystal lattice decreases significantly faster when compared to the square lattice. This study sheds light on the minimum fraction of disconnections allowed to see percolation of quantum particle on these quasicrystal lattices.
We present universal continuous variable quantum computation (CVQC) in the micromaser. With a brief history as motivation we present the background theory and define universal CVQC. We then show how to generate a set of operations in the micromaser w
hich can be used to achieve universal CVQC. It then follows that the micromaser is a potential architecture for CVQC but our proof is easily adaptable to other potential physical systems.
Given any quantum error correcting code permitting universal fault-tolerant quantum computation and transversal measurement of logical X and Z, we describe how to perform time-optimal quantum computation, meaning the execution of an arbitrary Cliffor
d circuit followed by a layer of independent T gates and any necessary feedforward measurement determined corrective S gates all in the time of a single physical measurement. We assume fast classical processing and classical communication, and argue the reasonableness of this assumption. This enables fault-tolerant quantum computation to be performed orders of magnitude faster than previously thought possible, with the execution time independent of the error correction strength.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quan
tum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
