اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSystems Theory of Classical and Quantum Fields and Applications to Quantum Computing and Control
74
0
0.0
(
0
)
تأليف
M. Yanagisawa
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We explore a field theoretical approach to quantum computing and control. This book consists of three parts. The basics of systems theory and field theory are reviewed in Part I. In Part II, a gauge theory is reinterpreted from a systems theoretical perspective and applied to the formulation of quantum gates. Then quantum systems are defined by introducing feedback to the gates. In Part III, quantum gates and systems are reformulated from a quantum field theoretical perspective using S-matrices. We also discuss how gauge fields are related to feedback.
قيم البحث
اقرأ أيضاً
This is a pre-publication version of a forthcoming book on quantum atom optics. It is written as a senior undergraduate to junior graduate level textbook, assuming knowledge of basic quantum mechanics, and covers the basic principles of neutral atom
matter wave systems with an emphasis on quantum technology applications. The topics covered include: introduction to second quantization of many-body systems, Bose-Einstein condensation, the order parameter and Gross-Pitaevskii equation, spin dynamics of atoms, spinor Bose-Einstein condensates, atom diffraction, atomic interferometry beyond the standard limit, quantum simulation, squeezing and entanglement with atomic ensembles, quantum information with atomic ensembles. This book would suit students who wish to obtain the necessary skills for working with neutral atom many-body atomic systems, or could be used as a text for an undergraduate or graduate level course (exercises are included throughout). This is a near-final draft of the book, but inevitably errors may be present. If any errors are found, we welcome you to contact us and it will be corrected before publication. (TB: tim.byrnes[at]nyu.edu, EI: ebube[at]nyu.edu)
We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products between quantum stabilizer state
s and product states, thereby generalizing mappings for some specific models established in [Phys. Rev. Lett. 98, 117207 (2007)]. For Ising- and Potts-type models with and without external magnetic field, we show how the entanglement features of the corresponding stabilizer states are related to the interaction pattern of the classical model, while the choice of product states encodes the details of interaction. These mappings establish a link between the fields of classical statistical mechanics and quantum information theory, which we utilize to transfer techniques and methods developed in one field to gain insight into the other. For example, we use quantum information techniques to recover well known duality relations and local symmetries of classical models in a simple way, and provide new classical simulation methods to simulate certain types of classical spin models. We show that in this way all inhomogeneous models of q-dimensional spins with pairwise interaction pattern specified by a graph of bounded tree-width can be simulated efficiently. Finally, we show relations between classical spin models and measurement-based quantum computation.
This paper is concerned with the concept of {em information state} and its use in optimal feedback control of classical and quantum systems. The use of information states for measurement feedback problems is summarized. Generalization to fully quantu
m coherent feedback control problems is considered.
Heterogeneous high-performance computing (HPC) systems offer novel architectures which accelerate specific workloads through judicious use of specialized coprocessors. A promising architectural approach for future scientific computations is provided
by heterogeneous HPC systems integrating quantum processing units (QPUs). To this end, we present XACC (eXtreme-scale ACCelerator) --- a programming model and software framework that enables quantum acceleration within standard or HPC software workflows. XACC follows a coprocessor machine model that is independent of the underlying quantum computing hardware, thereby enabling quantum programs to be defined and executed on a variety of QPUs types through a unified application programming interface. Moreover, XACC defines a polymorphic low-level intermediate representation, and an extensible compiler frontend that enables language independent quantum programming, thus promoting integration and interoperability across the quantum programming landscape. In this work we define the software architecture enabling our hardware and language independent approach, and demonstrate its usefulness across a range of quantum computing models through illustrative examples involving the compilation and execution of gate and annealing-based quantum programs.
In 2013, Farid and Vasiliev [arXiv:quant-ph/1310.4922] for the first time proposed a way to construct a protocol for the realisation of {em Classical to Quantum} one-way hash function, a derivative of the Quantum one-way function as defined by Gottes
man and Chuang [Technical Report arXiv:quant-ph/0105032] and used it for constructing quantum digital signatures. We, on the other hand, for the first time, propose the idea of a different kind of one-way function, which is {em quantum-classical} in nature, that is, it takes an $n$-qubit quantum state of a definite kind as its input and produces a classical output. We formally define such a one-way function and propose a way to construct and realise it. The proposed one-way function turns out to be very useful in authenticating a quantum state in any quantum money scheme and so we can construct many different quantum money schemes based on such a one-way function. Later in the paper, we also give explicit constructions of some interesting quantum money schemes like quantum bitcoins and quantum currency schemes, solely based on the proposed one-way function. The security of such schemes can be explained on the basis of the security of the underlying one-way functions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
