arXiv:1612.05969

The unitary dynamical state-locking process, the HSSS quantum search process, and the quantum-computing speedup theory

Xijia Miao

Published Dec 18, 2016• 0 citations

Abstract

A unitary dynamical state-locking (UNIDYSLOCK) process is a unitary process that can transform two orthogonal states to two non-orthogonal states. Its inverse process, i.e., the QUANSDAM process could realize an exponential QC speedup in solving an unstructured search problem in the quantum-computing (QC) speedup theory (X. Miao, arXiv:1105.3573 [quant-ph] (2011)). In this paper the principle of how a UNIDYSLOCK process works is described on the basis of the QC speedup theory. A UNIDYSLOCK process does not exist at all in pure quantum mechanics. That it can change the quantum-state difference is original from the fundamental interaction between the quantum physical laws (i.e., the unitary quantum dynamics and the Hilbert-space symmetric structure) and the mathematical-logical principle of the search problem. It is characteristic for the QC speedup theory. Even if a usual quantum computational (Qc) process that is reversible or unitary contained a UNIDYSLOCK (or QUANSDAM) process, the contribution of the UNIDYSLOCK (or QUANSDAM) process to the QC speedup of the usual Qc process would be secondary or negligible. Whether or not a UNIDYSLOCK (or QUANSDAM) process can make an essential contribution to a QC speedup can distinguish the QC speedup theory from any usual Qc theory. In the paper the QC speedup mechanism of the HSSS quantum search process is also studied. The search process is essentially different from a usual quantum search algorithm. It works in both the usual Hilbert space and the math Hilbert space. Due to the math Hilbert space a mathematical-parallel operation is characteristic for the QC speedup theory, while a quantum-parallel operation is characteristic for the usual Qc theory. The fundamental interaction mentioned above and the fundamental quantum-computing resource play the main role in speeding up the search process.

DOI: 10.48550/arxiv.1612.05969

Related papers

The universal quantum driving force to speed up a quantum computation -- The unitary quantum dynamics

Xijia Miao

It is shown in the paper that the unitary quantum dynamics in quantum mechanics is the universal quantum driving force to speed up a quantum computation. This assertion supports strongly in theory that the unitary quantum dynamics is the fundamental and universal principle in nature. On the other hand, the symmetric structure of Hilbert space of a composite quantum system is the quantum-computing resource that is not owned by classical computation. A new quantum-computing speedup theory is set up on the basis of the unitary quantum dynamics. Both the unitary quantum dynamics and the symmetric structure and property of the Hilbert space of the quantum system are mainly responsible for an exponential quantum-computing speedup for a general efficient quantum algorithm. The inherent importance for the unitary quantum dynamics to speed up a quantum computation lies in the unique ability of the unitary quantum dynamics to build the effective interaction between the symmetric structure of the Hilbert space of the quantum system and the mathematical symmetric structure of a problem to be solved on the quantum system. This unique ability could result in an essential difference of computational power between quantum and classical computations by combining the symmetric structure and property of the Hilbert space. The new quantum-computing speedup theory also provides reasonable mechanisms for exponential quantum-computing speedup for the existing efficient quantum algorithms based on the quantum parallel principle. These existing quantum algorithms including the hidden-subgroup-problem quantum algorithms and conventional quantum search algorithms have the common character that the symmetric structure of the Hilbert space does not have any effective effect on these quantum algorithms. This could be the main reason why these quantum algorithms are quite special and considered to be semiclassical.

arXiv:1105.3573May 18, 20112 citations

Subspace-selective unitary manipulation based on the Hilbert-space symmetric structures in the multiple-quantum operator algebra spaces in the quantum-computing speedup theory

Xijia Miao

The quantum-computing speedup theory considers the symmetric structures and properties of quantum systems as the fundamental Quantum-Computing-Speedup (QCS) resources which are responsible for exponentially speeding up quantum computing and simulating. At present a large and important problem is how to make use of the fundamental QCS resources to speed up essentially quantum computing and simulating. Here the author makes a great effort toward solving this important problem. The theoretical research work in this paper is mainly divided into the two Parts I and II. The Part I investigates mainly the multiple-quantum operator algebra spaces. And the relationships are analyzed among the multiple-quantum operator algebra spaces, quantum simulating for the unitary time-evolutional processes, and the fundamental QCS resources which exist in the different kinds of basic quantum spaces: the multiple-quantum operator algebra spaces, the density operator spaces, and the Hilbert spaces. It concludes that the multiple-quantum operator algebra space must be positioned as the central place where the fundamental QCS resources are exploited to speed up quantum computing and simulating. The Part II investigates mainly the subspace-selective unitary manipulation based on the Hilbert-space symmetric structures. Recognize that the multiple-quantum operator algebra space is the central place. Then those fundamental QCS resources original from the Hilbert space (a quantum-state space) must be explicitly taken into account in the multiple-quantum operator algebra space (a linear operator space). This is an important problem. The subspace-selective unitary manipulation is able to solve this problem. It aims to harness the fundamental QCS resources original from the Hilbert space to speed up quantum computing and simulating in the multiple-quantum operator algebra space.

quant-pharXiv:2606.03859Jun 3, 20260 citations

The duality-character Solution-Information-Carrying (SIC) unitary propagators

Xijia Miao

The HSSS quantum search process owns the dual character that it obeys both the unitary quantum dynamics and the mathematical-logical principle of the unstructured search problem. It is essentially different from a conventional quantum search algorithm. It is constructed with the duality-character oracle operations of unstructured search problem. It consists of the two consecutive steps: (1) the search-space dynamical reduction and (2) the dynamical quantum-state-difference amplification (QUANSDAM). The QUANSDAM process is directly constructed with the SIC unitary propagators, while the latter each are prepared with the basic SIC unitary operators. Here the preparation for the SIC unitary propagators of a single-atom system is concretely carried out by starting from the basic SIC unitary operators. The SIC unitary propagator of a quantum system may reflect the quantum symmetry of the quantum system, while the basic SIC unitary operators may not. The quantum symmetry is considered as the fundamental quantum-computing-speedup resource in the quantum-computing speedup theory. The purpose for the preparation is ultimately to employ the quantum symmetry to speed up the QUANSDAM process. The preparation is a solution-information transfer process. It is unitary and deterministic. It obeys the information conservation law. In methodology it is based on the energy eigenfunction expansion and the multiple-quantum operator algebra space. Furthermore, a general theory mainly based on the Feynman path integration technique and also the energy eigenfunction expansion method is established to treat theoretically and calculate a SIC unitary propagator of any quantum system in the coordinate representation, which may be further used to construct theoretically an exponential QUANSDAM process in future.

arXiv:2012.13250Dec 24, 20200 citations

Quantum search processes in the cyclic group state spaces

Xijia Miao

The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other known quantum operations. In order to bypass the square speedup limitation of a standard quantum search algorithm it is necessary to develop other type of quantum search algorithms. It is described in detail in the paper for a quantum dynamical method to solve the quantum search problems in the cyclic group state space. The binary dynamical representation for a quantum state in the Hilbert space of the n-qubit quantum system is generalized to the multi-base dynamical representation for a quantum state in the cyclic group state space. Thus, any quantum state in the cyclic group state space may be described completely in terms of a set of dynamical parameters that are closely related to the symmetric property and structure of the cyclic group. The quantum search problem therefore could be solved by determining the set of dynamical parameters that describe completely the unknown marked state of the search problem instead by directly measuring the marked state which is a necessary step in the standard quantum search algorithm. An unstructured quantum search problem in the Hilbert space is inevitably affected greatly by the symmetric property and structure of a group. The main attempt of the paper is to make use of the symmetric properties and structures of groups to help solving the quantum search problems in the group state spaces. It is shown how the quantum search process could be reduced from the cyclic group state space to these cyclic group state subspaces with the help of the symmetric property and structure of the cyclic group on a universal quantum computer.

arXiv:quant-ph/0507236Jul 25, 20053 citations

The basic principles to construct a generalized state-locking pulse field and simulate efficiently the reversible and unitary halting protocol of a universal quantum computer

Xijia Miao

It has been shown (Arxiv: quant-ph/0507236) that a universal quantum computer could be powerful enough to solve efficiently the quantum search problem, and the reversible and unitary halting protocol based on the state-locking pulse field is the key component to construct the efficient quantum search processes, while the state-locking pulse field is the key component to generate the reversible and unitary halting protocol. In this paper the reversible and unitary halting protocol and the generalized state-locking pulse field have been extensively investigated theoretically. The basic principles to construct the state-locking pulse field and design the reversible and unitary halting protocol are studied in detail. A generalized state-locking pulse field is generally dependent upon the time and space variables. It could be a sequence of time- and space-dependent electromagnetic pulse fields and could also contain the time- and space-dependent potential fields. Thus, the reversible and unitary halting protocol built up out of the state-locking pulse field generally consists of a sequence of time- and space-dependent unitary evolution processes. It is shown how the quantum control process is constructed to simulate efficiently the reversible and unitary halting protocol. An improved subspace-reduction quantum program and circuit based on the reversible and unitary halting protocol is proposed as the key component to construct further an efficient quantum search process. A simple atomic physical system that is an atomic ion or a neutral atom in the double-well potential field is proposed to show how the state-locking pulse field is generated and how to implement the reversible and unitary halting protocol.

arXiv:quant-ph/0607144Jul 20, 20061 citation

Unitary manipulation of a single atom in time and space --- The spatially-selective and internal-state-selective triggering pulses

Xijia Miao

A spatially-selective and internal-state-selective triggering pulse is an important component to realize the unitary dynamical state-locking process which may be used to realize the reversible and unitary halting protocol and construct the unstructured quantum search process based on the tensor-product Hilbert-space symmetric structure and the unitary quantum dynamics. In this paper it is shown how a spatially-selective and internal-state-selective triggering pulse is constructed generally in the quantum system of a single atom. Rigorous theoretical calculation and error estimation, which are based on the Trotter-Suzuki decomposition method and the multiple-Gaussian-wave-packet expansion method, are carried out for the time evolution process of a single atom in the double-well potential field and in the presence of the spatially-selective and internal-state-selective triggering pulse. It proves that the spatially-selective and internal-state-selective triggering pulse is feasible, that is, the possible errors generated by the triggering pulse are shown to be controllable. This rigorous theoretical calculation also shows that the spatially-selective and internal-state-selective triggering pulse may be different from its corresponding ideal internal-state-selective triggering pulse that is not spatially selective, but the difference between their final states of the time evolution process is controllable. These computational results are achieved with the help of the Gaussian wave-packet motional states and the space-dependent quadratic Hamiltonians of a single atom. The methods and techniques developed in the paper are useful for studying the quantum-computing speedup mechanism of the unitary quantum dynamics in the quantum system of a single atom.

arXiv:1309.3758Sep 15, 20130 citations