A geometrical approach to quantum holonomic computing algorithms

نویسندگان

  • Anatoly M. Samoilenko
  • Y. A. Prykarpatsky
  • Ufuk Taneri
  • A. K. Prykarpatsky
  • D. L. Blackmore
چکیده

The work continues a presentation of modern quantum mathematics backgrounds started in [3]. A general approach to quantum holonomic computing based on geometric Lie algebraic structures on Grassmann manifolds and related with them Lax type flows is proposed. Making use of the differential geometric techniques like momentum mapping reduction, central extension and connection theory on Stiefel bundles it is shown that the associated holonomy groups properly realizing quantum computations can be effectively found concerning diverse practical problems. Two examples demonstrating 2-form curvature calculations important for describing the corresponding holonomy Lie algebra are presented in detail.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Solutions of Holonomic Quantum Computation

Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard, CNOT and 2-qubit discrete Fourier transformation gates are explicitly constructed.

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

Realization of arbitrary gates in holonomic quantum computation

Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space gen...

متن کامل

Refocusing schemes for holonomic quantum computation in presence of dissipation

Due to the fragility of quantum coherence in the presence of noise, decoherence is the main obstacle to the practical realization of quantum computation. Exploring potential ways to implement robust quantum computation therefore is a crucial and attractive challenge. To the aim of stabilizing quantum information a variety of decoherence-reduction techniques have been developed, such as quantum ...

متن کامل

Evaluation of holonomic quantum computation: adiabatic versus nonadiabatic.

Based on the analytical solution to the time-dependent Schrödinger equations, we evaluate the holonomic quantum computation beyond the adiabatic limit. Besides providing rigorous confirmation of the geometrical prediction of holonomies, the present dynamical resolution offers also a practical means to study the nonadiabaticity induced effects for the universal qubit operations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 66  شماره 

صفحات  -

تاریخ انتشار 2004