Announcing: Slashdot Deals - Explore geek apps, games, gadgets and more. (what is this?)

Thank you!

We are sorry to see you leave - Beta is different and we value the time you took to try it out. Before you decide to go, please take a look at some value-adds for Beta and learn more about it. Thank you for reading Slashdot, and for making the site better!



Two-Photon Walk a Giant Leap For Quantum Computing

Catullus Re:Exponential Speedup?? (112 comments)

This comment isn't accurate. There are problems for which quantum computers are indeed exponentially faster than our best known algorithms running on a standard computer. The most important of these is probably simply quantum simulation - i.e. simulating quantum mechanical systems. This has umpteen applications to physics, chemistry and molecular biology (e.g. drug design).

more than 4 years ago

Coders At Work

Catullus Re:Socially relevent (207 comments)

How about Hu Jintao, Paramount Leader of China, not to mention hydraulic engineer? I think there may be a few people in China who have heard of him.

more than 5 years ago

Bugatti's Latest Veyron, Most Ridiculous Car on the Planet?

Catullus Re:Guilty conscience? (790 comments)

Google is your friend. The figures quoted in that article don't completely bear out the original claim (the very rich give a higher percentage of their incomes than the averagely wealthy), but the poorest do indeed seem to give more than anyone else.

more than 5 years ago

I'll keep my castle secure primarily with ...

Catullus Moat (828 comments)

The watery option is clearly the way to go - you can even claim it on expenses!

more than 5 years ago

Scientists To Post Individuals' DNA Sequences To Web

Catullus Re:I'd do this in a second (219 comments)

A woman who joins the Air Force has over a 99% chance of being raped by a fellow member of the service sometime during their career.

Do you have a source for that rather surprising fact?

more than 6 years ago



Are all the best games NP-hard?

Catullus Catullus writes  |  more than 4 years ago

Catullus (30857) writes "Following in the footsteps of Tetris and Minesweeper, the simple yet addictive multiplatform game Flood-It is the latest puzzle to be proven to be hardNP-hard, to be exact. This means that there's no way to write an efficient program to beat the game, unless P=NP. This research by computer scientists from Bristol University raises the intriguing question: are these games fun precisely because they're hard for computers to solve, and need a spark of human creativity?"
Link to Original Source



A quantum computation FAQ

Catullus Catullus writes  |  more than 8 years ago

Here are some answers to frequently asked questions on Slashdot about the field of quantum computation. If you have any more questions, please post them as comments below.

What resources are available for me to learn about quantum computation?

The best resource is the book "Quantum Computation and Quantum Information" by Nielsen and Chuang. There are also several good sets of lecture notes available online. My favourite introduction (for computer scientists) is Abbas Edalat's lecture notes. John Preskill's lecture notes are excellent, but tougher going.

Can quantum computers solve NP-complete problems?

It is not known whether quantum computers can solve NP-complete problems (such as graph colouring or satisfiability) quickly. So far, nobody has come up with a quantum algorithm to solve such problems, and there is some evidence that quantum algorithms cannot solve NP-complete problems. However, proving this would imply that P != NP, which is the most important unsolved problem in theoretical computer science. So don't hold your breath for a proof.

(more to be added later...)

Slashdot Login

Need an Account?

Forgot your password?