Related papers: The duality-character Solution-Information-Carryin…
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…
The multiple-quantum operator algebra formalism has been exploited to construct generally an unsorted quantum search algorithm. The exponential propagator and its corresponding effective Hamiltonian are constructed explicitly that describe…
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…
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a…
Realizing non-unitary transformations on unitary-gate based quantum devices is critically important for simulating a variety of physical problems including open quantum systems and subnormalized quantum states. We present a dilation based…
Nonautonomous linear ordinary differential equations of the form $\dot{v}(t) = A(t)\, v(t)$, where $A(t)$ is non-skew-symmetric, are often used to describe nonunitary dynamics in a variety of fields that range from open quantum system…
In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of…
Systematic iterative algorithms of supersymmetric quantum mechanics (SUSYQM) type for solving the eigenequation of principal hypergeometric-like differential operator (HLDO) and for generating the eigenequation of associated HLDO itself as…
The quantum propagator and characteristic equation in the presence of a chain of $\delta$-potentials are obtained in the rectangular, cylindrical and spherical coordinate systems. The simplicity and efficiency of the method is illustrated…
The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT…
\textsc{Quantum Package} is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods…
Duality quantum computing (DQC) offers the use of linear combination of unitaries (LCU), or generalized quantum gates, in designing quantum algorithms. DQC contains wave divider and wave combiner operations. The wave function of a quantum…
Quantum computers have demonstrated utility in simulating quantum systems beyond brute-force classical approaches. As the community builds on these demonstrations to explore using quantum computing for applied research, algorithms and…
Symmetric informationally complete measurements (SICs) are elegant, celebrated and broadly useful discrete structures in Hilbert space. We introduce a more sophisticated discrete structure compounded by several SICs. A SIC-compound is…
Quantum computational sensing (QCS) combines quantum sensing with quantum computing to extract task-relevant information from the physical world. QCS can in principle achieve an accuracy advantage for specific tasks versus the alternative…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
Unitary designs are unitary ensembles that emulate Haar-random unitary statistics. They provide a vital tool for studying quantum randomness and have found broad applications in quantum technologies. However, existing research has focused…
We propose and experimentally demonstrate sequential quantum computing (SQC), a paradigm that utilizes multiple homogeneous or heterogeneous quantum processors in hybrid classical-quantum workflows. In this manner, we are able to overcome…
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…
Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires $d^2$ input states and $d^4$ quantum…