Related papers: A quantum dynamical approach to matrix Khrushchev'…
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this context, the notion of quantum hitting time is very important,…
Quantum corrections to the Schwarzschild metric generated by loop diagrams have been considered by Bjerrum-Bohr, Donoghue, and Holstein (BHD) [Phys. Rev. D68, 084005 (2003)], and Khriplovich and Kirilin (KK) [J. Exp. Theor. Phys. 98, 1063…
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a…
We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…
The roots of a monic polynomial expressed in a Chebyshev basis are known to be the eigenvalues of the so-called colleague matrix, which is a Hessenberg matrix that is the sum of a symmetric tridiagonal matrix and a rank-1 matrix. The…
The Gershgorin Circle Theorem is a well-known and efficient method for bounding the eigenvalues of a matrix in terms of its entries. If $A$ is a symmetric matrix, by writing $A = B + x{\bf 1}$, where ${\bf 1}$ is the matrix with unit…
The continuous-time quantum walk (CTQW) on root lattice $A_n$ (known as hexagonal lattice for $n=2$) and honeycomb one is investigated by using spectral distribution method. To this aim, some association schemes are constructed from abelian…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum…
An algebraic interpretation of the one-variable quantum $q$-Krawtchouk polynomials is provided in the framework of the Schwinger realization of $\mathcal{U}_{q}(sl_{2})$ involving two independent $q$-oscillators. The polynomials are shown…
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm and uses the evolution operator of Grover's algorithm because…
Quantum simulation is known to be capable of simulating certain dynamical systems in continuous time -- Schrodinger's equations being the most direct and well-known -- more efficiently than classical simulation. Any linear dynamical system…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
Quantum systems are dynamic systems restricted by the principles of quantum mechanics (linearity of dynamic equations, linear transformation of the wave function etc.). One suggests to investigate the quantum systems simply as dynamic…
We establish an isomorphism between quantum circuits and a subspace of polyatomic molecules, which suggests that molecules can be used as descriptors of quantum circuits for quantum machine learning. Our numerical results show that the…
In this paper we introduce a new method for the simulation of a weak solution of the Schr\"odinger-type equation where the potential is piecewise constant and positive. The method, called killing walk on spheres algorithm, combines the…
Discrete-time quantum walk in one-dimension is studied from a path-integral perspective. This enables derivation of a closed-form expression for amplitudes corresponding to any coin-position basis of the state vector of the quantum walker…
The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. The circuit model usually implements a desired unitary…
Permutational Quantum Computing (PQC) [\emph{Quantum~Info.~Comput.}, \textbf{10}, 470--497, (2010)] is a natural quantum computational model conjectured to capture non-classical aspects of quantum computation. An argument backing this…
A general approach to obtain reduced models for a wide class of discrete-time quantum systems is proposed. The obtained models not only reproduce exactly the output of a given quantum model, but are also guaranteed to satisfy physical…