Showing posts with label computation. Show all posts
Showing posts with label computation. Show all posts

Friday, October 14, 2016

A step closer to quantum computation with Quantum Error Correction



Computer scientists have dreamt of large-scale quantum computation since at least 1994 -- the hope is that quantum computers will be able to process certain calculations much more quickly than any classical computer, helping to solve problems ranging from complicated physics or chemistry simulations to solving optimization problems to accelerating machine learning tasks.

One of the primary challenges is that quantum memory elements (“qubits”) have always been too prone to errors. They’re fragile and easily disturbed -- any fluctuation or noise from their environment can introduce memory errors, rendering the computations useless. As it turns out, getting even just a small number of qubits together to repeatedly perform the required quantum logic operations and still be nearly error-free is just plain hard. But our team has been developing the quantum logic operations and qubit architectures to do just that.

In our paper “State preservation by repetitive error detection in a superconducting quantum circuit”, published in the journal Nature, we describe a superconducting quantum circuit with nine qubits where, for the first time, the qubits are able to detect and effectively protect each other from bit errors. This quantum error correction (QEC) can overcome memory errors by applying a carefully choreographed series of logic operations on the qubits to detect where errors have occurred.
Photograph of the device containing nine quantum bits (qubits). Each qubit interacts with its neighbors to protect them from error.

So how does QEC work? In a classical computer, we can monitor bits directly to detect errors. However, qubits are much more fickle -- measuring a qubit directly will collapse entanglement and superposition states, removing the quantum elements that make it useful for computation.

To get around this, we introduce additional ‘measurement’ qubits, and perform a series of quantum logic operations that look at the measurement and data qubits in combination. By looking at the state of these pairwise combinations (using quantum XOR gates), and performing some careful cross-checking, we can pull out just enough information to detect errors without altering the information in any individual qubit.
The basics of error correction. ‘Measurement’ qubits can detect errors on ‘data’ qubits through the use of quantum XOR gates.

We’ve also shown that storing information in five qubits works better than just storing it in one, and that with nine qubits the error correction works even better. That’s a key result -- it shows that the quantum logic operations are trustworthy enough that by adding more qubits, we can detect more complex errors that otherwise may cause algorithmic failure.

While the basic physical processes behind quantum error correction are feasible, many challenges remain, such as improving the logic operations behind error correction and testing protection from phase-flip errors. We’re excited to tackle these challenges on the way towards making real computations possible.
Read More..

Wednesday, February 10, 2016

Public Key Cryptography Computation Cash and John Nash

This Thursday Associate Professor Steven Galbraith, a leading researcher in computational number theory and the mathematics of public key cryptography, will give a free public lecture at the University of Auckland. Steven has published over 50 papers in this area, written one book, and edited three conference proceedings. He has a Bachelors degree from the University of Waikato, a Masters from Georgia Tech in Atlanta, and he completed his PhD at Oxford University in 1996. He has had post-doc or visiting researcher positions at Royal Holloway University of London (UK), British Telecom Research (Ipswich, UK), University of Waterloo (Canada), Institute for Experimental Mathematics (Essen, Germany), University of Bristol (UK) and Hewlett-Packard Research Labs (Bristol, UK). He has been at the University of Auckland since 2009.
The lecture titled "Public Key Cryptography: Computation, Cash and John Nash" will explain how security can be enhanced by the use of hard computational problems from Mathematics. This was the basis for the creation of publi c key cryptography in the 1970s. Public key cryptography has many applications in information security, such as secure internet shopping, digital signatures and secure automatic software updates. We will see how digital signatures have now become a crucial component of the electronic currency bitcoin. Cryptography is, of course, of great interest to national security. Recently (only declassified in 2012) it has been revealed that John Nash (subject of the film A Beautiful Mind) sent a letter to the United States National Security Agency in 1955. His letter outlined new concepts that anticipated by decades fundamental notions in computational complexity and modern cryptography.
When: 6pm (free refreshments) for 6.30pm start, Thursday 15th May, 2014
Where: Owen G Glenn Building, Room OGGB3/260-092

Note that there is public parking in the basement of the Owen G Glenn Building at 12 Grafton Road.



from The Universal Machine http://universal-machine.blogspot.com/

IFTTT

Put the internet to work for you.

Turn off or edit this Recipe

Read More..
 
Copyright 2009 Information Blog
Powered By Blogger