### Q&A Categories

## Find a Question:

## A new scheme for quantum computation

Jul

1

2013

A new scheme for quantum computation

Tom Wong, a graduate student in physics, and David Meyer, a professor of mathematics at the University of California, San Diego, have proposed a new algorithm for quantum computing, which will speed up the solution of problems specific type. But as the analysis of scientists, the acceleration of calculations require the involvement of a greater number of physical resources required for accurate timekeeping.

The algorithm is used to solve problems in the area of unstructured search. The goal is to find a particular item in the array of unsorted data. The solution to this problem on a classical computer that uses ones and zeros that are stored on magnetic media, akin Flipped deck of cards one by one, according to Wong. search in a large array of data will take a very long time.

Quantum computing, built on a quantum state, often within a very short period of time , takes advantage of the strange quantum world, where particles such as photons and bosons may exist in more than one state at a time. This situation is called a superposition. This effect is interesting opportunities for parallel computing, however, immediately after the measurement, as we well know , quantum objects give a definite answer.

The focus is to develop algorithms that will cancel the wrong answers and the right to accumulate. The nature of the algorithm depends on the environment in which the information is stored.

Meyer and Wong suggested computer built in a special state of matter called a Bose-Einstein condensate. Atoms get into electromagnetic trap and cooled to such an extent that “fall” in the lowest quantum state and act as a single unit.

The equation is commonly used to describe the quantum system is linear, but that describes the state of the Bose-Einstein condensate, is an element in a cube. In an article published in the New Journal of Physics, researchers suggested that computation cubic equation that will answer faster. For example, the algorithm can be used to locate a particular element of millions like, and at the same time – of ten items.

“It looks like a grand deception” – said Wong, however, a careful analysis of the theoretical part of the plan Wong and Meyer found that the increase in speed will require substantial physical effort.

Since the search works unpredictable timing, using atomic clocks, must be very precise. This requirement imposes a lower limit on the number of ions that make up the atomic clock.

Another resource is a very computing environment, Bose-Einstein condensate.

“If we want to run this algorithm, we need to collect a certain number of atoms” – says Wong. – “And that’s how much we need the atoms to this nonlinear equation has earned consistent and basic quantum theory? This is new. ”

Back Pioneer started selling car navigator with augmented reality

Scientists have cloned the mouse forward just a single drop of blood

Tags: Quantum entanglement , quantum mechanics , quantum computers .

Tags: quantum computers, Quantum entanglement, Quantum Mechanics

#### Answer this Question

You must be Logged In to post an Answer.

Not a member yet? Sign Up Now »

### Star Points Scale

Earn points for Asking and Answering Questions!