Jump to content

Talk:Quantum computing

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2601:c:5600:27b:c92a:eebe:6758:c647 (talk) at 17:51, 18 January 2015 (Invented When?: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Former featured articleQuantum computing is a former featured article. Please see the links under Article milestones below for its original nomination page (for older articles, check the nomination archive) and why it was removed.
Article milestones
DateProcessResult
January 19, 2004Refreshing brilliant proseKept
May 9, 2006Featured article reviewKept
May 13, 2007Featured article reviewDemoted
Current status: Former featured article

Contradictory statements regarding space?

The introduction suggests that simulating an n-bit quantum computer on a classical TM requires 2^n discrete states. But doesn't this contradict the later statement that QBP is a subset of PSPACE? (Erniecohen (talk) 15:50, 14 October 2012 (UTC))[reply]

It's just an example of how a classical computer could simulate a quantum computer. It doesn't mean that it's the only way to do so. --Robin (talk) 15:55, 14 October 2012 (UTC)[reply]
The problem is that the way that it is written, it strongly implies that quantum computing provides a space advantage, which is just false, so the 2^500 crap should just be removed. The relevant connection between the models is just that a classical TM can simulate a quantum computer with a polynomial blowup in space, but is strongly believed to require an exponential blowup in time. — Preceding unsigned comment added by Erniecohen (talkcontribs) 16:04, 14 October 2012 (UTC)[reply]
I wasn't aware of this. Do you have a reference? Skippydo (talk) 19:27, 14 October 2012 (UTC)[reply]

Has this been resolved? It seems odd to me in any case to say that 2500 complex values is equivalent to 2501 bits (does this mean that there are only four complex values available)? W. P. Uzer (talk) 12:27, 2 February 2014 (UTC)[reply]

Given these two objections, I've commented out the sentence in question for the moment. W. P. Uzer (talk) 08:50, 4 February 2014 (UTC)[reply]

How does it work... really!

It seems like this article would benefit from explaining how quantum computers work physically. I assume they manipulate individual atoms, but how?

Announcing new results

/(

"..(-2,334)‎ . .(Sorry, Wikipedia is not the place to announce new results. See WP:OR) .." - and wghere, WHERE is such place, for new ideas, announcing and discuss them, developing them more, and .."brainstorming",maybe ?, or just constructive discussion.. yap, according that "WP:OR" document, if we all would strictly managed by it, it would be means, - all advancing, all scientific and technical development would be almost stopped, in fact.. bcos no one would know about any new ideas, new results, new.. anything.. :/(

\( — Preceding unsigned comment added by Martin Hovorka (talkcontribs) 19:30, 2 September 2013 (UTC)[reply]

deleting of new idea announcing

/(

hmm... not even just announce,a bit, any new idea (imho quite promising, relevant, and ..perspective.., this my multi-Sieves/Sifthering Q.C. Idea) ..even nor get,make a little advertisement,and spreading-out, for this new,constructive,fresh-brigth concept.. :\( (..but it is, and always was, my idea, trying make Q.Computing with this concept of sieve, /sifter approach,/concept(sieving) — Preceding unsigned comment added by Martin Hovorka (talkcontribs) 20:57, 2 September 2013 (UTC)[reply]

It's your fault for announcing the idea here. Doesn't everyone know by now that, if you want to patent an invention, you must do so within one year of publication. Under the new US patent law, publication may make it impossible to patent it at all. (And, yes, posting it on Wikipedia constitutes "publication".) — Arthur Rubin (talk) 21:07, 2 September 2013 (UTC)[reply]

other wiki for discussing quantum ideas

There is a common misconception that people who support the WP:OR policy are people who don't want to see any original research on any wiki.

Actually, some of us *do* want to see original research on a wiki -- but on an appropriate wiki where such research is on-topic, not just any random wiki.

There are over 10,000 English-language wiki. Pretty much any topic you can think of is on-topic at at least one of them. In particular, quantum computing seems to be on topic at several wiki including http://quantiki.org/ , Wikia: 3dids, http://quantum.cs.washington.edu/ , http://wiki.qcraft.org/ , http://c2.com/cgi/wiki?QuantumComputing , http://twoqubits.wikidot.com/ , http://chemwiki.ucdavis.edu/Physical_Chemistry/Quantum_Mechanics , http://www.physics.thetangentbundle.net/wiki/Quantum_mechanics , etc.

--DavidCary (talk) 04:30, 15 January 2014 (UTC)[reply]

Quantum supercomputer

Is it really the case that a quantum computer is "also known as a quantum supercomputer"? I've never seen that usage before & suspect it should be deleted. --24.12.205.104 (talk) 00:48, 6 January 2014 (UTC)[reply]

HOW CAN A QUANTUM COMPUTER CREATE

there is a requirement for a new index system there is not any part of quantum that will give 0 zero nothing a value my understanding is quantum is the least amount of energy required to create change within a structure of mass. E=Mc2. no structure of Energy or mass within any environment can change unless another structure of energy or mass has the ability to influence or interact with that unit of structure. 0 zero nothing does not have the ability to interact. relativity and quantum will only reconcile when relativity recognizes 0 zero nothing has no potential to exist or create. lets look at the potential of a quantum computer. 0 and 1 cannot create a interaction of change . why. 1 has a value and therefore has a potential structure 0 within classical mechanics will only ever have no structure and therefore cannot interact therefore. only value 0 or 1 or any other quantity of 0 or 1,s can represent is a unique value. for quantum to create a computer language o zero nothing cannot be a partner, The singularity of 0 zero nothing will never evaluate change or interaction. compound mathematics or very basic energy/mass interaction. even a higgs boson is a unit of energy that has an exact mass value as the potential of a velocity to transport at the speed of light for a period time it environment allows.Cubedmass 01:22, 26 January 2014 (UTC) — Preceding unsigned comment added by Cubedmass (talkcontribs)

Cubedmass: ?? — Arthur Rubin (talk) 19:12, 2 February 2014 (UTC)[reply]

misc suggestions / solving chess - programming the universe - more intuitive intro

I think it would be great if the article mentioned solving chess as something that quantum computing would allow.

I also think Seth Lloyd's book "Programming the Universe" should be referenced somewhere.

The first sentence I think is too technical. It tells precisely what the term means in physics, it doesn't give any layman sense as to what quantum computing is. It almost sounds like: "Quantum computing is a process where computers use quantum systems to do computing". A layman will want to know something basic immediately like the fact that quantum computers are extremely fast and will soon be replacing standard computers.

...My 2 cents. Squish7 (talk) 00:40, 26 March 2014 (UTC)[reply]

Page title should be "Quantum computing"

To my sensibility, this page title is all wrong.

Computer science is no more about computers than astronomy is about telescopes.Edsger Dijkstra

Additionally, Google

 "quantum computing" -"quantum computer"

gives 2,440,000 results

 -"quantum computing" "quantum computer" 

gives 961,000 results, so one appears without the other significantly more often. — MaxEnt 05:10, 5 May 2014 (UTC)[reply]

 DoneRuud 18:01, 21 December 2014 (UTC)[reply]

Quantum games

A collection of IPs is adding an announcement of "the first quantum computer game". Even if this were sourced to a reliable source (it's not at all in the reference specified, which is a blog [not even a blog entry], and all I can find is a blog entry pointing to the announcement by the creator), would it be appropriate for the article? — Arthur Rubin (talk) 05:49, 21 May 2014 (UTC)[reply]

The announcement by the alleged creator is not a reliable source, either. — Arthur Rubin (talk) 10:39, 24 May 2014 (UTC)[reply]

Rotistor - The Entangled Rotating at various spins Memristors

The "ROTISTOR" is a term introduced by PhD. professor Veiler Sword at July 14, 2014. It is a non atomic quantum processor. It is a series of entangled memristors, that rotate by switching on and of. Each rotating entangled memristor of the overall rotistor rotates at various rpms. We let the rotistor render data at varius rpm combination controlled by noise and hum numeric generators, for simple tasks we don't use hum/noise ordered spin but algorithms. (hum and noise here are not sounds but numeric diffraction/diffusion modes) Then we average the optimum solution (or solutions) by a classic CPU and an opperating number theory program.


Why is it better that atomic quantum computers? It is cheep, it works at non-extreme temperatures, easier to built, you can entangle as many rotating components you wish, if you want more accuracy you can entangle rotating memristor components with more available rotational angles, it is cheep to maintain-does not easily break.


we all know that quantum computers are atomic entangled spin apparatuses, but requier very low temperatures and that is not practical for massive productions.

we know also that quantum computers are averaging data machines, so they run very vast and average the optimum option.

we can build mechanical and electrical non atomic quantum computers that allow entangled spin rotations, and still we will have to average running the apparatus for 500msec to average many million probable solution to select the optimum.

today we have the math and the know how.

Also, we all know about low temperature hypermagnetic levitation. We can mimic that at normal temperatures, with to classic electromagnets, but in order the system does not fail at the sides we have to create a complex magnetic grid, that even inverses at some points the field polarization in order the system does not fail at one side.


Well, in my lab I have mixed both. Quantum non atomic computing and rotational systems, but we can build rotistors, tiny electric parts like entangled memristors that rotate at different speeds - each component, we run the rotistor for 500 msec to average and extract the optimum solution.

Of course the old rotistors are not so fast, so it might take 3 seconds to average the optimum solition, but a well build one is way faster.

The Koch family can support that effort!

We need practical solutions with tiny rotistors so billions of people can buy a cheep great quantum computer and not like today, that we have so few atomic quantum computers that allow a tiny only number of entangled rotating components.

The more it costs a design, the sillier the builder, and the most boring the science behind.

We need PRACTICAL applications available for EVERYONE and HUGE computational power to subserve everyday tasks and not theoretical only.

The "correct" entangled answers allow more current, higher values, wider dynamic ranges.

strongly need th consider of change the title of this wiki-page from Q. "Computer" to "COMPUTING"

can be title of whole wiki-page re-turned to be Quantum COMPUTING, as it was before ? as "Computing" is far more fitting, more overal term for this wiki page´ topic, as just 1 concrete THE "computer") — Preceding unsigned comment added by 78.99.236.255 (talk) 17:49, 23 July 2014 (UTC)[reply]

 DoneRuud 18:01, 21 December 2014 (UTC)[reply]

Invented When?

You should discuss when Quantum computing was invented and the purpose of Quantum Computing at the time.