Re: Quantum computer using using artificial atoms.

From: Trevor L. Jackson, III (tlj3_at_comcast.net)
Date: 02/26/05


Date: Sat, 26 Feb 2005 16:48:33 -0500

jstevh@msn.com wrote:
> cesarbremer@raseac.com.br wrote:
>
>>The guys at National Institute of Standards and Technology (NIST) and
>>University of California, Santa Barbara (UCSB) allowed the
>
> construction
>
>>of logic gates in a quantum computer, creating qubits from
>>superconducting circuit elements called Josephson junctions.
>
>
> Sorry to horn in a bit, but I think there's an important point to be
> made that quantum ideas have to do with *mechanical* factoring.

No there isn't.

>
> Yeah, I know, it's quantum, and all kind of interesting physics
> associated with what is to many a mystical word, but I have a B.Sc. in
> physics, and I know that you're just talking about specialized
> mechanical devices when you talk about quantum computing.

Wrong.

>
> So if there's a mechanical way, then there must be a purely
> mathematicized way.

No.

>
> That is, the quantum world is a world that follows rules--mathematical
> rules.

No.

>
> And if quantum devices--mechanical devices--can do something, then the
> rules can be abstracted out, just like has been done in other areas.

No.

>
> Like you can use an abacus, or you can use algebra.

No.

>
> I think that surrogate factoring is just a first step in that direction
> of abstracting out those mathematical rules, which allow you to build
> fully mathematical systems for factoring, or anything else a quantum
> computer can do.

No it isn't. "Surrogate Factoring" is Snake Fur. Snake Fur is the
material that makes Snake Oil, which see, adhere to reptilian epidermal
surfaces.

>
> You see, it's about ideas. The ideas are what's important, not
> necessarily the specifics of the implementation.

Wrong. Ideas are cheap. See any psychedelic. Working ideas are rare
and valuable. Working ideas have a viable implementation. So the
implementation is what generates the value not the idea.

>
> If quantum computers can work, then there are algorithms that can do
> the same thing, which can be implemented on a general purpose thinking
> device--a computer--to do the same thing.

No.

>
> It has occurred to me that given Shor's algorithm there has to be a
> fully mathematicized version of it.

No.

>
> Read your history. There have been other mechanical factoring ideas.

Follow your own advice: read the history and don't come back here until
you can describe the single factor that distinguishes workable
mechanical factoring ideas from unworkable mechanical factoring ideas.

>
> Many of you see "quantum" and reason goes out the window and you think
> it's voodoo or something else magical.

No, just different.

>
> It's just a word. Get over it, and use your noodle.

A word that means something you do not understand.

>
> What a quantum computer can do, a gp computer with the appropriate
> algorithms can do.

No.

/tj3



Relevant Pages

  • Re: Quantum Computer Algorithms
    ... A quantum computer is similar, except that it can do a couple of extra ... A "nondeterministic Turing machine" and a "quantum computer" ... The difference is that while a nondeterministic Turing machine is a totally ... Just as nondeterministic algorithms are sequences of operations that can be ...
    (sci.physics.research)
  • Re: Quantum Computer Algorithms
    ... A quantum computer is similar, except that it can do a couple of extra ... A "nondeterministic Turing machine" and a "quantum computer" ... The difference is that while a nondeterministic Turing machine is a totally ... Just as nondeterministic algorithms are sequences of operations that can be ...
    (sci.physics.relativity)
  • Quantum algorithms and complexity of computation
    ... Keith Ramsay wrote: ... > | Let's guess that it will take our quantum computer one second to ... > exponentially growing number of nodes, and there's no reason to think ... > #algorithms altogether, ...
    (sci.math)
  • Re: How long IF IT IS A DRAW?
    ... You're reasoning as though your quantum computer was able to search an ... and there's no reason to think ... #algorithms altogether, ... chess algorithms had emerged in the past few years. ...
    (sci.math)