Quantum Automata: More than 1 Start State?

  • Thread starter Thread starter michinobu
  • Start date Start date
  • Tags Tags
    Automata Quantum
AI Thread Summary
Quantum automata differ from traditional finite automata by potentially having multiple start states, or more accurately, a superposition of start states. This characteristic raises questions about their practical application in physical computing, particularly regarding the challenges of preparing specific start states for quantum computers. The discussion touches on the relationship between finite automata and Turing machines, noting that while finite automata alone do not equate to physical computers, Turing machines serve as a mathematical model for computation. Quantum computers, leveraging quantum bits (qubits), promise significant reductions in computational time, especially for tasks like cryptography. The conversation also references the famous thought experiment of Schrödinger's cat, illustrating the complexities of quantum states, though some participants express confusion over its implications in real-world scenarios. Overall, the dialogue emphasizes the theoretical underpinnings of quantum computation and its potential advantages over classical computing models.
michinobu
Messages
53
Reaction score
0
Unlike normal finite automata, which always have one start state, it seems that quantum automata can actually have more than one start state. How would one be able to use this as a real physical computer, if by pressing the power button on your computer it might not start - but, rather morph into a black-hole and suck you along with everyone or everything you care about (joking)?
 
Technology news on Phys.org
You would use it for practical joke purposes only
 
I think it wouldn't be so much that a quantum automata has "more than one" start state, but more like the quantum finite automata has a superposition of possibly more than one start state, which isn't exactly the same thing. As for how this would be used "in a real physical computer", as far as I'm aware the idea of preparing a specific start state for a quantum computer is actually kind of difficult.

Are you sure you mean to ask about a "finite automata"? As far as I know most research which treats quantum computers as automata concerns Quantum Turing Machines, although I guess all actual quantum computers are finite and maybe I am missing something.
 
Coin said:
Are you sure you mean to ask about a "finite automata"? As far as I know most research which treats quantum computers as automata concerns Quantum Turing Machines, although I guess all actual quantum computers are finite and maybe I am missing something.

Well, if you've ever taken an undergrad-level computational course and paid attention, you'd know that finite automata are related to Turing machines. The only thing is that Turing machines have infinite memory because they can go back and forth in their input tape.
Just like how PDA's (Push-Down Automata) are finite automata with stacks for added memory.
Alone, a finite automata wouldn't equate to a physical computer, but the Turing Machine is the mathematical equivalent of a computer. Everything you can do with a physical computer can be done with a Turing Machine, except for the fact that it's something that can only be observed in your head so you couldn't watch you-tube on a Turing Machine. That is, unless you were crazy.

But, I hear that using quantum computer would cut down computational time considerably. For instance, when trying to crack the key to a cipher, you'd have a machine which would have four-state bits instead of the two-state bits that we have (see quantum bits).

I never taken a course on quantum computation, but my professor brought this up in an unrelated class and he told us about this scenario where you have a cat in a box and you fire a gun into it. In the world of quantum mechanics and quantum computation, the cat has four states: dead, alive, neither, or both. It doesn't make sense in real-life, maybe I wasn't paying attention so I missed the big "aha!" part of his little speech. However, I think his story was credible, in that they actually do talk about it in relation to quantum mechanics, because the same same cat-in-the-box scenario was brought up in an anime series (I forget the title) where this little girl is visited by her friends from the future in an alternate dimension.
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...

Similar threads

Back
Top