ﻻ يوجد ملخص باللغة العربية
We investigate the symmetry breaking role of noise in adiabatic quantum computing using the example of the CNOT gate. In particular, we analyse situations where the choice of initial configuration leads to symmetries in the Hamiltonian and degeneracies in the spectrum. We show that, in these situations, there exists an optimal level of noise that maximises the success probability and the fidelity of the final state. The effects of an artificial noise source with a time-dependent amplitude are also explored and it is found that such a scheme would offer a considerable performance enhancement.
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we can solve l
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers $R(m,n)$ with $m,ngeq 3$, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers $R(
In the Graph Isomorphism problem two N-vertex graphs G and G are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G. If yes, then G and G are said to be isomorph
The success of adiabatic quantum computation (AQC) depends crucially on the ability to maintain the quantum computer in the ground state of the evolution Hamiltonian. The computation process has to be sufficiently slow as restricted by the minimal en
The quantum computation of electronic energies can break the curse of dimensionality that plagues many-particle quantum mechanics. It is for this reason that a universal quantum computer has the potential to fundamentally change computational chemist