• Hey, guest user. Hope you're enjoying NeoGAF! Have you considered registering for an account? Come join us and add your take to the daily discourse.

Nature: Quantum computers ready to leap out of the lab in 2017

Status
Not open for further replies.

Kinitari

Black Canada Mafia
I was about to post this, it was a great read for me a while ago.

The reality of quantum computers is so different than what you percieve from reading popular mechanics esque articles. For people who are curious, this article really helped me out:

https://www.ias.edu/ideas/2014/ambainis-quantum-computing

There are several tasks for which a quantum computer will be useful. The one that is mentioned most frequently is that quantum computers will be able to read secret messages communicated over the internet using the current technologies (such as RSA, Diffie-Hellman, and other cryptographic protocols that are based on the hardness of number-theoretic problems like factoring and discrete logarithm). But there are many other fascinating applications.
First of all, if we have a quantum computer, it will be useful for scientists for conducting virtual experiments. Quantum computing started with Feynman’s observation that quantum systems are hard to model on a conventional computer. If we had a quantum computer, we could use it to model quantum systems. (This is known as “quantum simulation.”) For example, we could model the behavior of atoms and particles at unusual conditions (for example, very high energies that can be only created in the Large Hadron Collider) without actually creating those unusual conditions. Or we could model chemical reactions—because interactions among atoms in a chemical reaction is a quantum process.
Another use of quantum computers is searching huge amounts of data. Let’s say that we have a large phone book, ordered alphabetically by individual names (and not by phone numbers). If we wanted to find the person who has the phone number 6097348000, we would have to go through the whole phone book and look at every entry. For a phone book with one million phone numbers, it could take one million steps. In 1996, Lov Grover from Bell Labs discovered that a quantum computer would be able to do the same task with one thousand steps instead of one million.
More generally, quantum computers would be useful whenever we have to find something in a large amount of data: “a needle in a haystack”—whether this is the right phone number or something completely different.
Another example of that is if we want to find two equal numbers in a large amount of data. Again, if we have one million numbers, a classical computer might have to look at all of them and take one million steps. We discovered that a quantum computer could do it in a substantially smaller amount of time.
 

Jisgsaw

Member
I know the research and commercial-scale benefits of quantum computing are vast, but, when would we see a reasonably-priced PQC (personal quantum computer)? 2030? 2040?

EDIT: I should add that my question above assumes 2017 is the year we see functioning engineering, not just research-based stuff.

The better question would be: what the hell would you want to do with a personal quatum computer?

They work on a very different logic than current computers, and are theoretically only better at very specific thing normal people shouldn't have any interest in. It won't run Windows or your Internet browser faster.
 

commedieu

Banned
The better question would be: what the hell would you want to do with a personal quatum computer?

They work on a very different logic than current computers, and are theoretically only better at very specific thing normal people shouldn't have any interest in. It won't run Windows or your Internet browser faster.

hopefully for rendering/lighting solutions. Particle simulations... Cloth simulations... things like that.
 

Linkyn

Member
I thought -- it was going to change the way we do binary. I mistakenly said fractions between 0 and 1, but it seems to be more to it than that -- "qubits" -- having something to do with the state of 0 and 1.

I'm stopping from contributing now, as I'm sure someone on GAF knows how to explain it.

Google is working on a quantum machine, they had a doc on Youtube. thats where I'm getting my information from. Its about the size of a room currently.. They seemed to sell it on speed of calculations that would take X time... would take Y time with quantum processing.

The difference is that a classical bit can have exactly 2 values - 0 and 1, whereas a qbit can contain any superposition of those two states. Common examples of qbits are things like particles with spin or polarised light. This all goes back to the basic premise of the wavefunction of a system being the superposition of all its possible states, with the function collapsing into one of its substates when you interact with the system.

One interesting thing about quantum computation is that factorisation problems, which are at the heart of encryption methods like Diffie-Hellman, are easily solvable (eg by using Shor's algorithm), so many classical encryption methods become effectively worthless once quantum computation is available.
 

turmoil

Banned
In the future we may have to take into account neural processing units and quantum processing units besides CPUs, GPUs, etc for our PCs.

If those bring us better videogame AI I welcome them.
 
Definitely earlier. The moment this becomes production-ready, Google, Amazon and Microsoft will rush to get them for their cloud-based projects (whatever the f they are at that moment). Which means production R&D will be eaten up by these giants mostly, and from that point, it will be about figuring out how to actually use them in any clientside program in a way that warrants that increased pricetag.

Apple Q for $3000 in your hand, in 2022? You bet.

Err I highly doubt that...

Getting quantum computers productized, matured and then miniaturised to the point of being able to slip a qCPU into your smart phone is probably a lifetime or two away.


Miniaturisation depends heavily on the physics involved, and so for say superconductive quantum computers for example, where qubits have to be stored at freezing temperatures, you have about as much chance of seeing a miniaturised processor, as you do seeing a functional tokomak fusion reactor that with fit in your remote controlled toy car.

Basically we're kinda reaching the point right now, where we were with silicon based processors in the the 60s-70s; where productization will be tantamount to machines occupying warehouse-sized server-spaces, with heavily enterprise-orientated service consumption.

It'll also take a very very long time for the utility of these things to become much more widely realised, with the early hardware models being useful for very very specialised, mostly scientific use cases. We'll need new data transformations and encodings, new machine code instruction sets, new high-level programming languages completely with novel idioms and paradigms, new development tools, protocols etc etc.

This is basically millions of man hours of research and development that needs to be spent even after the HW is functional and stable.

On a separate note, productization of quantum computing hardware has already started (MS, Google et al are already LTTP).

D Wave Systems
already has a 16 qubit quantum computer available for highly specialised, commercial usage and has done for quite a few years.
 
In the future we may have to take into account neural processing units and quantum processing units besides CPUs, GPUs, etc for our PCs.

If those bring us better videogame AI I welcome them.

Quantum "computers" for now use superconductivity afaik. I think you won't see liquid helium tanks at home for videogames.
 

commedieu

Banned
The difference is that a classical bit can have exactly 2 values - 0 and 1, whereas a qbit can contain any superposition of those two states. Common examples of qbits are things like particles with spin or polarised light. This all goes back to the basic premise of the wavefunction of a system being the superposition of all its possible states, with the function collapsing into one of its substates when you interact with the system.

Thanks Linkyn,

Question time:

1. When you say superposition, is that a range of values between 0 and 1. Is a 'fraction' in between a good way of thinking of it? Or are you saying that 0 and 1 can have multiple values, rather than our current two definite 0 or 1 values.

2. How would a quantum machine be utilized in a calculative capacity, that would be superior to today's traditional machines?

I'll LogOff and take my answer offline.

Thank you.
 

Easy_D

never left the stone age
I for one can't wait until we use quantum computing to simulate a world much like ours to watch them advance in technology at an advanced rate and then copy their tech.
 
Thanks Linkyn,

Question time:

1. When you say superposition, is that a range of values between 0 and 1. Is a 'fraction' in between a good way of thinking of it? Or are you saying that 0 and 1 can have multiple values, rather than our current two definite 0 or 1 values.

2. How would a quantum machine be utilized in a calculative capacity, that would be superior to today's traditional machines.

1. It's not range, it basically means you can have a state of 1, a state of 0 or 1+0 at the same time.

2. There's some pretty interesting possibilities for specialised quantum algorithms, which exploit the behaviours of the hardware and enable you to reduce incredibly large, problem sets down to a solution super quickly. E.g. if a traditional algorithm wanted to figure out the optimal play in a game of chess, it could sequentially work through every permutation of every possible move and take an non-trivial amount of time (or non-trivial amount of computing resources) to process that information. Even a humble quantum computer with a dozen or so qubits, could basically calculate every possible permutation of every possible move all at the same time and provide you with an answer within fractions of a second.
 
Hi everyone, uninformed plebeian here.

I know people are joking about Crysis, but what does this actually for consumer stuff like gaming? Smartphones? Computers? Or is it as simple as the same stuff, but just really, really fast?
 

Linkyn

Member
Thanks Linkyn,

Question time:

1. When you say superposition, is that a range of values between 0 and 1. Is a 'fraction' in between a good way of thinking of it? Or are you saying that 0 and 1 can have multiple values, rather than our current two definite 0 or 1 values.

2. How would a quantum machine be utilized in a calculative capacity, that would be superior to today's traditional machines?

I'll LogOff and take my answer offline.

Thank you.

1. In quantum theory, superposition refers to the idea that any linear combination of two valid states gives another valid state. What that means is that, since both 0 and 1 are valid states for a qbit, any linear combination of the two is also a valid state that the qbit can be in. You can think of it as having all of one, or all of the other, or a bit of both. The only basic restriction is that if the superposed state contains more of one state, it contains less of the other, so that the total probability of being in any one state is never more than unity (I'm sorry if this all sounds a bit technical). In essence, though, it means that the qbit can potentially be in any of an infinity of possible superposed states.

One big difficulty arises here because of readout. Even if a quantum system can exist in a superposition of its possible 'eigenstates' (1 and 0 in this case), whenever you interact with it, it collapses back into one of them. The nature of the superposed state determines how likely each outcome is, but a priori, it's impossible to predict with certainty which one it'll be (unless the system was already in one of its eigenstates). In practice, this means that whenever you read the value of the qbit, you risk losing information, so quantum computing systems and algorithms need to be created with that in mind.

2. Obvious advantages in computation are in problems that can be very iteration-heavy, like factorisation for instance. To me, the more interesting application lies in quantum key distribution, which uses entanglement to create and share private encryption keys.
 
Back in 1971 the first Intel processor was made up of 2,300 transistors. Intel now produce microprocessors with more than 5bn transistors. However, they’re still limited by their simple binary options. With quantum computers the bits, or “qubits” as they are known, afford far more options owing to the uncertainty of their physical state.

In the mysterious subatomic realm of quantum physics, particles can act like waves, so that they can be particle or wave or particle and wave. This is what’s known in quantum mechanics as superposition. As a result of superposition a qubit can be a 0 or 1 or 0 and 1. That means it can perform two equations at the same time. Two qubits can perform four equations. And three qubits can perform eight, and so on in an exponential expansion. That leads to some inconceivably large numbers, not to mention some mind-boggling working concepts.

In a neat, spacious lab in Burnaby, a satellite of Vancouver, I’m looking inside what appears to be a large black fridge about 10 feet high. Within it is an elaborate structure of circuit boards, not unlike the sort of thing a physics class might construct out of Meccano, except with beautifully colourful niobium wafers as the centrepiece. It all looks fairly unremarkable, yet somewhere in here a multiplicity of different universes are thought to exist.

The lab belongs to a small company called D-Wave, a highly skilled collection of just 140 employees that prides itself on building the world’s first functioning quantum computer, which is what is contained within the large fridge-like casing. Actually it is a fridge, the coldest fridge ever assembled. The cooling apparatus enables the niobium computer chip at its core to function at a temperature of just under –273C, or as close to absolute zero as the known universe gets.

The supercooled environment is necessary to maintain coherent quantum activity of superposition and entanglement, the state in which particles begin to interact – again rather mysteriously – co-dependently, and the qubits are linked by quantum mechanics regardless of their position in space. Any intrusion of heat or light would corrupt the process and thus the effectiveness of the computer.

Exactly how and why quantum physics adheres to these science-fiction like rules remains an issue of great speculation, but perhaps the most common theory is that the different quantum states exist in separate universes. The D-Wave quantum computer I look at has one thousand qubits.

“A thousand qubit computer can be in 2 to the 1,000 states at one time, which is 10 to the 300th power,” says D-Wave’s CEO, Vern Brownell. “There’s only 10 to the 80th atoms in the universe. Now does this mean it’s in 10 to the 300th universes at the same time?”

Can billions of different universes coexist within one computer?
https://www.theguardian.com/technology/2016/may/22/age-of-quantum-computing-d-wave

Legit shook.
 

Hazzuh

Member
RE: Quantum computers breaking encryption. While it's true that they can break lots of algorithms, there do exist a number of classical algorithms which appear to be quantum secure. Lattice-based cryptography for example.

Overall, the singular most valuable thing a quantum computer can do right now is serve as a perfect quantum simulator (ie it can efficiently simulate any quantum system). Quantum computers will likely never be more useful than classical computers outside of certain specific instances imo, for a generic problem quantum computers only offer a quadratic speedup (O(N) -> O(sqrt(N))). Given how difficult it is to create coherence between qubits I am sceptical there will exist a time in which a quadratic speedup is worth all the trouble.
 

Jisgsaw

Member

hopefully for rendering/lighting solutions. Particle simulations... Cloth simulations... things like that.

Fair enough.
These aren't really applications most people would use.

Hi everyone, uninformed plebeian here.

I know people are joking about Crysis, but what does this actually for consumer stuff like gaming? Smartphones? Computers? Or is it as simple as the same stuff, but just really, really fast?

No, it works on different concepts an current computers.
That means all the programmjng languages and compilers will have to be redone, on top of the fact that quantum computing is only really good at iterative tasks (e.g. factoring) due to the nature of qbits.
Even if the hardware is running, consumer non scientific applications are decades off. For the scientific work though, it should be huge, and lead to improvement in other areas (e.g. Far better weather forecast, better cryptography and so on)
 
RE: Quantum computers breaking encryption. While it's true that they can break lots of algorithms, there do exist a number of classical algorithms which appear to be quantum secure. Lattice-based cryptography for example.

Overall, the singular most valuable thing a quantum computer can do right now is serve as a perfect quantum simulator (ie it can efficiently simulate any quantum system). Quantum computers will likely never be more useful than classical computers outside of certain specific instances imo, for a generic problem quantum computers only offer a quadratic speedup (O(N) -> O(sqrt(N))). Given how difficult it is to create coherence between qubits I am sceptical there will exist a time in which a quadratic speedup is worth all the trouble.

Computational sciences have become a massive industry and dominate sectors such as aerospace, mechanical and finance engineering. Could quantum computers not provide a significant leap in available power for these fields?
 

Jisgsaw

Member
Computational sciences have become a massive industry and dominate sectors such as aerospace, mechanical and finance engineering. Could quantum computers not provide a significant leap in available power for these fields?

It could... if people develop algorithm tailored to them. Iirc, FEM simulations could be sped up significantly (or be made with much smaller elements), which should enable engineer to attain better result through better simulations.
 
Computational sciences have become a massive industry and dominate sectors such as aerospace, mechanical and finance engineering. Could quantum computers not provide a significant leap in available power for these fields?

They already do:

http://www.bbc.co.uk/news/science-environment-22554494

...<snip>...

Annealing is made possible by an effect in physics known as quantum tunnelling, which can endow each qubit with an awareness of every other one.

"The gate model... is the single worst thing that ever happened to quantum computing", Geordie Rose, chief technology officer for D-Wave, told BBC Radio 4's Material World programme.

"And when we look back 20 years from now, at the history of this field, we'll wonder why anyone ever thought that was a good idea."

Dr Rose's approach entails a completely different way of posing your question, and it only works for certain questions.

But according to a paper presented this week (the result of benchmarking tests required by Nasa and Google), it is very fast indeed at finding the optimal solution to a problem that potentially has many different combinations of answers.
In one case it took less than half a second to do something that took conventional software 30 minutes.

A classic example of one of these "combinatorial optimisation" problems is that of the travelling sales rep, who needs to visit several cities in one day, and wants to know the shortest path that connects them all together in order to minimise their mileage.

The D-Wave Two chip can compare all the possible itineraries at once, rather than having to work through each in turn.

Reportedly costing up to $15m, housed in a garden shed-sized box that cools the chip to near absolute zero, it should be installed at Nasa and available for research by autumn 2013.

US giant Lockheed Martin earlier this year upgraded its own D-Wave machine to the 512 qubit D-Wave Two.
 

commedieu

Banned
The difference is that a classical bit can have exactly 2 values - 0 and 1, whereas a qbit can contain any superposition of those two states. Common examples of qbits are things like particles with spin or polarised light. This all goes back to the basic premise of the wavefunction of a system being the superposition of all its possible states, with the function collapsing into one of its substates when you interact with the system.

One interesting thing about quantum computation is that factorisation problems, which are at the heart of encryption methods like Diffie-Hellman, are easily solvable (eg by using Shor's algorithm), so many classical encryption methods become effectively worthless once quantum computation is available.

1. It's not range, it basically means you can have a state of 1, a state of 0 or 1+0 at the same time.

2. There's some pretty interesting possibilities for specialised quantum algorithms, which exploit the behaviours of the hardware and enable you to reduce incredibly large, problem sets down to a solution super quickly. E.g. if a traditional algorithm wanted to figure out the optimal play in a game of chess, it could sequentially work through every permutation of every possible move and take an non-trivial amount of time (or non-trivial amount of computing resources) to process that information. Even a humble quantum computer with a dozen or so qubits, could basically calculate every possible permutation of every possible move all at the same time and provide you with an answer within fractions of a second.

1. In quantum theory, superposition refers to the idea that any linear combination of two valid states gives another valid state. What that means is that, since both 0 and 1 are valid states for a qbit, any linear combination of the two is also a valid state that the qbit can be in. You can think of it as having all of one, or all of the other, or a bit of both. The only basic restriction is that if the superposed state contains more of one state, it contains less of the other, so that the total probability of being in any one state is never more than unity (I'm sorry if this all sounds a bit technical). In essence, though, it means that the qbit can potentially be in any of an infinity of possible superposed states.

One big difficulty arises here because of readout. Even if a quantum system can exist in a superposition of its possible 'eigenstates' (1 and 0 in this case), whenever you interact with it, it collapses back into one of them. The nature of the superposed state determines how likely each outcome is, but a priori, it's impossible to predict with certainty which one it'll be (unless the system was already in one of its eigenstates). In practice, this means that whenever you read the value of the qbit, you risk losing information, so quantum computing systems and algorithms need to be created with that in mind.

2. Obvious advantages in computation are in problems that can be very iteration-heavy, like factorisation for instance. To me, the more interesting application lies in quantum key distribution, which uses entanglement to create and share private encryption keys.

Ok.. I think I get it..

Today we have 0 and 1. With quantum computers you get 0 and 1, 0+1 and 1+0...to compute data....?

as far as the rest... I'll reply after I get my engineering degree... bbl... getting my GED...
 
Or better yet...

Quantum_Break_cover.jpg

Not even quantum computers would make this fun to play.
 

Hazzuh

Member
Computational sciences have become a massive industry and dominate sectors such as aerospace, mechanical and finance engineering. Could quantum computers not provide a significant leap in available power for these fields?

Unless many more quantum algorithms which offer an exponential speedup compared to the classic case are discovered then I am deeply sceptical. Basically it needs to be cheaper for a company to use a quantum computer than an ordinary one, if N^2 bits could do the same job as N qubits then I doubt that will ever be the case outside of a few special applications (CERN and spy agencies).

Arent this Google systems just the D-Wave quantum computers? Which use https://en.wikipedia.org/wiki/Quantum_annealing instead of general quantum computing. Which is the reason they only are faster at encryption / searching databases and stuff.

Google do own a D-Wave machine but this is there own internal team. They are working with John Martinis who is the best person at superconducting qubits in the world. The D-wave machine can't actually implement Shor's algorithm. A general quantum annealer could be universal but because of the limited connectivity of the D-Wave chip it isn't universal.

But how to you build a quantum computer? I mean does it only need more power to generate more stuff faster ?

There are as many ways to build a quantum computer as there are quantum systems (although most of them are crap). What you basically need is 1. Something to be your qubit ie a two-level quantum system (for example, two excited energy levels of an electron or the nucleus of an atom) 2. Some way of getting many of these qubits to interact however you like (you want to be able to manipulate them arbitrarily so you can implement any algorithm and also "read out" the end result) 3. Some way of stopping these qubits interacting with the environment (quantum systems that interact with the environment lose some of their "quantumness" and cease to be useful). I'm sure you can see that the issue is that 2. and 3. sort of contradict, anything that you can easily manipulate with your laser or magnetic field or w/e will also interact with stray electric or magnetic fields in the environment. This is the main issue.
 
Just tell me this is going to bring us closer to the singularity, which will solve all our problems and make me into a perfect cyborg person.
 

ibyea

Banned
I am going to go over the concept of quantum superposition here since someone asked, and it is quiet a weird subject to understand. Furthermore the explanation that superposition of 0 and 1 is both at the same time is very misleading, so I am hoping to shed some light on it.

So for regular waves, superposition can add or cancel waves. So if you drip water on a water surface, and do the same on another place, the two places will have waves coming out of them, propagating outwards. When the waves intersect, you will see areas where they enhance each other or subtract each other. Quantum superposition is similar, but there is an additional weirdness to it.

So consider than a particle is in a state where it has a probability of 3/4 to be in energy 1 and 1/4 for energy 2, and let's ignore the specific numbers of what those energies are. Just know the probability of which energy the particle will end up (you can do it with position or momentum or other physical descriptions). So the state for energy 1 is denoted as |1> and for energy 2 as |2>, so |n> is some function (you can think of it being in terms of position if you want, but it can be any physical quantity) that has energy n. It gets stranger, those functions are complex functions, meaning they are in the form of a + i*b, where i is sqrt(-1). So how can you obtain actual probability for them? The rule is that you multiply the complex conjugate of the functions, meaning a - i*b form, denoted as <n|, and this gives you a real number. One final basics is that <1|2>=0, while <1|1>=1, the reason being that if you measure energy 1 during the experiment, obviously you couldn't have measured energy 2 at the same time. Remember, once a measurement is done, which is done via some physical interaction, things are on lock, and the whole superposition disappears. Knowing the basic rules, let's see what happens.

So the superposition is denoted as: |state 1> = sqrt(3/4)*|1> + sqrt(1/4)*|2>.

Why square root? Because once multiplied by the complex conjugate, you want the whole thing to have probability one (similar to saying that the probability of getting either heads or tails in a coin flip is 1):

(sqrt(3/4)*<1| + sqrt(1/4)*<2|)*(sqrt(3/4)*|1> + sqrt(1/4)*|2>) = 3/4*<1|1> + 1/4*<2|2> + sqrt(3/16)*<1|2> + sqrt(3/16)*<2|1> = 3/4 + 1/4 = 1

So what if you want to find the probability of finding energy 1? Look above and see where 3/4*<1|1> is? That number tells you the probability. So, you have got such a particle and measure it. Let's say you measure it and say get energy 1. Then you recreate a particle of the same state and measure it again, obtaining energy 2. Do the same thing 1000 times, and you observe that 756 times you observed energy 1 and 244 times you measured energy 2. Notice how while each individual measurement gives you one or the other, if you do it a lot of times, the total numbers becomes closer and closer to the probability number? That is similar to how a coin flip works, where you might get 5 heads in a row at the beginning, but when you do it a thousand times, the number of heads and tails obtained are almost shared equally.

But see, this is where it is not like a coin flip. A particle might have state: |state 2> = sqrt(3/4)*|1> - sqrt(1/4)*|2>.

But wait a minute, isn't it redundant since it gives you the same probabilities?! It does give you the same probability, but what if you prepare the following?:

|state 3> = A*|state 1> + B*|state 2> = (A + B)*sqrt(3/4)*|1> + (A - B)*sqrt(1/4)*|2>

Now the fact that there is a minus sign matters. Let's say A = B, just to make a really eye popping example: |state 3> = 2A*sqrt(3/4)*|1>, and A = 1/2*sqrt(4/3) to make the probability equal 1. So |state 3> = |1>, and because of this there is zero chance energy 2 can be measured!

So I know this is going to be quiet difficult to interpret, especially those without a math background, but hopefully it informs what they mean by quantum superposition.
 
Status
Not open for further replies.
Top Bottom