اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLinear algebra and quantum algorithm
88
0
0.0
(
0
)
تأليف
BongJu Kim
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations of quantum mechanics had been established in around 1930, by von Neumann. The formulation uses functional analysis, linear algebra and probability theory. The knowledge of the mathematical formulation of QM is enough quantum mechanical knowledge for approaching to quantum algorithm and it might be efficient way for mathematicians that starting with mathematical formulations of QM. We explain the mathematical formulations of quantum mechanics briefly, quantum bits, quantum gates, quantum discrete Fourier transformation, Deutschs algorithm and Shors algorithm.
قيم البحث
اقرأ أيضاً
The purpose of this note is to discuss a few lines appearing in the work of late Fantappi`e. They concern the proof of rigidity of a specific real semisimple Lie algebra: ${mathfrak O}(4,1)$. Our intention is to discuss to what extent such proof cons
titutes a missed opportunity in history of post-war Italian mathematics.
In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers
among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.
We describe the construction of quantum gates (unitary operators) from boolean functions and give a number of applications. Both non-reversible and reversible boolean functions are considered. The construction of the Hamilton operator for a quantum g
ate is also described with the Hamilton operator expressed as spin system. Computer algebra implementations are provided.
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these results, we step
back into the classical domain, and explore its usefulness in designing classical algorithms. We achieve an algorithm for solving the major linear-algebraic problems in time $O(n^{omega+ u})$ for any $ u>0$, where $omega$ is the optimal matrix-product constant. Thus our algorithm is optimal w.r.t. matrix multiplication, and comparable to the state-of-the-art algorithm for these problems due to Demmel et. al. Being derived from quantum intuition, our proposed algorithm is completely disjoint from all previous classical algorithms, and builds on a combination of low-discrepancy sequences and perturbation analysis. As such, we hope it motivates further exploration of quantum techniques in this respect, hopefully leading to improvements in our understanding of space complexity and numerical stability of these problems.
Our title challenges the reader to venture beyond linear algebra in designing models and in thinking about numerical algorithms for identifying solutions. This article accompanies the authors lecture at the International Congress of Mathematicians 20
22. It covers recent advances in the study of critical point equations in optimization and statistics, and it explores the role of nonlinear algebra in the study of linear PDE with constant coefficients.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
