The Several Issues In Quantum Computation

Quantum computing and quantum information is a new interdisciplinary which isthe combination of quantum mechanics and theoretical computer. Since the proposalof concept of quantum computer in1982, the theory of quantum computer wasinterested by physicists, mathematicians and computer scientists which is rapiddevelopment. Further studies about quantum computer, universal quantumcomputation has great potential beyond the ordinary deterministic turning computing.With several representative effective quantum algorithms proposed and experimentalverification, quantum computing has become the forefront filed and direction of oneof the most talked about.In quantum circuit model, the more sophisticated algorithms such as the Shor’salgorithm, Deutsch-Jozsa algorithm, Grover algorithm have made a majorbreakthrough and progress. The Shor’s algorithm has got the exponentially accelerated.The Grover quantum search algorithm provides a root square acceleration. Quantumcomputer with the appropriate quantum algorithms can make some NP problems ofclassical computer exponentially accelerated. Quantum entanglement is a moreimportant nature of quantum mechanics. Researching the quantum entanglement andits applications, not only have positive implications for deep understanding of thequantum mechanics, but also for the developing of new quantum algorithm andresearching the quantum entanglement meaning for the quantum computing. In thispaper, according the Deutsch-Jozsa algorithm and the Grover algorithm, analysis anddeduce the quantum real equal weighted states, divides the structure degree of the realequal weighted states into seven parts, research every part real equal weighted state,conclude the multipartite separability and entanglement. The research of multipartileentanglement of real equal weighted states has great significance for the study of thenature of the entanglement.Adiabatic quantum algorithm is a new subject which is based on quantumadiabatic theorem. Using adiabatic quantum computing, only need to make the inputand evolution results be the physical quantities of a system and to manipulate theHamiltonian. In recent years, some institutions and researchers have devotedthemselves to the adiabatic quantum algorithm and have made some breakthrough and interesting results. The computing power of adiabatic quantum computing indicatesthe possible of solving some NP problem avoiding the difficulties faced by thetraditional quantum computing which is a significant of milestone. Ramsey theory is abranch of combinational mathematical, which is important significance in theinformation retrieval, communication and so on. Currently, the known Ramseynumber is few. Calculating the exact value grows exponentially. The progress ofresearching the Ramsey is slow. To determine Ramsey number is very difficult andimportant issue. In this paper, calculate the r-uniform hypergraph Ramsey using theadiabatic quantum algorithm. Map the r-uniform hypergraph Ramsey R (m, n; r)to acombinatorial optimization problem. Use the adiabatic quantum evolution to solve thecombinatorial problem and computer R (m, n; r). The algorithm is polynomiallyreducible compared to the classical algorithm.