Quantum Automata: More than 1 Start State?

  • Thread starter Thread starter michinobu
  • Start date Start date
  • Tags Tags
    Automata Quantum
Click For Summary

Discussion Overview

The discussion revolves around the concept of quantum automata, particularly the idea of having more than one start state compared to classical finite automata. Participants explore theoretical implications, practical applications, and the relationship between quantum automata and quantum computing.

Discussion Character

  • Exploratory
  • Debate/contested
  • Technical explanation

Main Points Raised

  • Some participants suggest that quantum automata can have more than one start state, while others clarify that it may be more accurate to describe this as a superposition of states.
  • There is a discussion about the challenges of preparing a specific start state for quantum computers.
  • One participant questions whether the original inquiry pertains to finite automata or Quantum Turing Machines, noting that most research focuses on the latter.
  • Another participant explains the relationship between finite automata and Turing machines, emphasizing that Turing machines are the mathematical equivalent of physical computers.
  • Participants mention the potential computational advantages of quantum computers, such as using four-state bits instead of two-state bits.
  • A reference is made to a thought experiment involving Schrödinger's cat, illustrating the complexities of quantum states, although one participant expresses uncertainty about the relevance of this analogy.

Areas of Agreement / Disagreement

Participants express differing views on the nature of start states in quantum automata, with no consensus reached on whether they can have multiple start states or if superposition is a more accurate description. The discussion remains unresolved regarding the implications of these concepts for practical quantum computing.

Contextual Notes

There are limitations in the discussion regarding the definitions of finite automata and Quantum Turing Machines, as well as the assumptions underlying the use of quantum states in computation.

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.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
6K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
4
Views
4K