[Paper Review] Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines

Daowen Qiu|ArXiv.org|Jan 30, 2005

Quantum Computing Algorithms and Architecture25 references3 citations

TL;DR

This paper introduces quantum multi-stack machines (QMSMs) and quantum multi-counter machines (QMCMs) with extended counting capabilities (±1, ±2, ..., ±n for n > 1), establishing well-formedness (W-F) conditions to ensure unitary evolution. It demonstrates that QMSMs can efficiently $(n,t)$-simulate quantum Turing machines (QTMs) with polynomial time slowdown, and QMCMs can simulate QMSMs with the same time complexity, thereby establishing the computational equivalence of QTMs and QMSMs/QMCMs in the quantum model.

ABSTRACT

As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved that for any quantum Turing machines $M$, there exists quantum Boolean circuit $(n,t)$-simulating $M$, where $n$ denotes the length of input strings, and $t$ is the number of move steps before machine stopping. However, the simulations of quantum Turing machines by quantum multi-stack machines and quantum multi-counter machines have not been considered, and quantum multi-stack machines have not been established, either. Though quantum counter machines were dealt with by Kravtsev [6] and Yamasaki {\it et al.} [10], in which the machines count with $0,\pm 1$ only, we sense that it is difficult to simulate quantum Turing machines in terms of this fashion of quantum computing devices, and we therefore prove that the quantum multi-counter machines allowed to count with $0,\pm 1,\pm 2,...,\pm n$ for some $n>1$ can efficiently simulate quantum Turing machines. Therefore, our mail goals are to establish quantum multi-stack machines and quantum multi-counter machines with counts $0,\pm 1,\pm 2,...,\pm n$ and $n>1$, and particularly to simulate quantum Turing machines by these quantum computing devices.

Motivation & Objective

• To define and formalize quantum multi-stack machines (QMSMs) by generalizing quantum pushdown automata to multiple stacks, ensuring unitary evolution via well-formedness (W-F) conditions.
• To introduce quantum multi-counter machines (QMCMs) with extended counting (0, ±1, ±2, ..., ±n for n > 1), distinct from prior quantum counter automata (QCAs), and to define their W-F conditions.
• To demonstrate that any QMCM capable of counting with ±n (n > 1) can be efficiently simulated by a QMCM restricted to counting with 0, ±1 only.
• To prove that quantum Turing machines (QTMs) can be efficiently $(n,t)$-simulated by QMSMs, and that QMCMs can be simulated by QMSMs with identical time complexity.
• To establish a foundation for quantum computational equivalence between QTMs, QMSMs, and QMCMs, extending classical computational equivalence to the quantum domain.

Proposed method

• Generalize quantum pushdown automata (QPDAs) to multi-stack systems to define quantum multi-stack machines (QMSMs), with state transition functions acting on the full stack configurations.
• Define well-formedness (W-F) conditions for QMSMs based on unitary evolution, ensuring that transition amplitudes satisfy unitarity constraints across all stack configurations.
• Introduce quantum multi-counter machines (QMCMs) with extended counting (0, ±1, ..., ±n for n > 1), differing from prior QCAs by using full counter state information in transitions.
• Establish W-F conditions for QMCMs that guarantee unitarity of time evolution, using a more succinct formulation than prior works.
• Construct a $(n,t)$-simulation of a QTM by a QMSM by encoding the QTM’s tape and head position into stack and counter states, preserving time complexity.
• Demonstrate that QMCMs with extended counting can be simulated by QMCMs with only 0, ±1 counting, using a counter encoding scheme that preserves unitarity and time efficiency.

Experimental results

Research questions

• RQ1 Can quantum multi-stack machines (QMSMs) be formally defined with well-formedness conditions ensuring unitary evolution, and can they simulate quantum Turing machines (QTMs) efficiently?
• RQ2 Can quantum multi-counter machines (QMCMs) with extended counting (0, ±1, ..., ±n for n > 1) be defined such that they simulate QTMs with polynomial time overhead?
• RQ3 Is it possible to simulate a QMCM that counts with ±n (n > 1) using a QMCM restricted to counting with only 0, ±1, while preserving time complexity and unitarity?
• RQ4 How do the W-F conditions for the proposed QMSMs and QMCMs compare in complexity and expressiveness to those of existing quantum counter automata (QCAs)?
• RQ5 Can quantum multi-stack machines simulate quantum multi-counter machines with the same time complexity, thereby enabling hierarchical simulation of QTMs?

Key findings

• The paper defines quantum multi-stack machines (QMSMs) by generalizing QPDAs to multiple stacks and provides succinct W-F conditions that ensure unitary evolution of the system.
• Quantum multi-counter machines (QMCMs) are introduced with extended counting capabilities (0, ±1, ..., ±n for n > 1), and their W-F conditions are formulated to preserve unitarity.
• Any QMCM that counts with ±n (n > 1) can be efficiently simulated by a QMCM restricted to counting with only 0, ±1, preserving time complexity.
• Quantum Turing machines (QTMs) can be $(n,t)$-simulated by QMSMs with a polynomial time slowdown of $O(n + t)$, establishing computational equivalence.
• QMCMs can be simulated by QMSMs with the same time complexity, confirming that QMSMs are at least as powerful as QMCMs in simulating QTMs.
• The W-F conditions for QMSMs and QMCMs are more succinct than those previously proposed for QCAs, improving clarity and practicality in quantum automaton design.