Related papers: Constructing General Unitary Maps from State Prepa…
We present and compare two methods of generating quantum feature maps for quantum-enhanced support vector machine, a classifier based on kernel method, by which we can access high dimensional Hilbert space efficiently. The first method is a…
We study the problems of state preparation, ground state preparation and quantum state preparation. We propose an analytic approach to a stochastic quantum algorithm which prepares the ground state for $n$-qubit Hamiltonian that is…
Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…
We study the ability to implement unitary maps on states of the $I=9/2$ nuclear spin in \textsuperscript{87}Sr, a $d=10$ dimensional (qudecimal) Hilbert space, using quantum optimal control. Through a combination of nuclear spin-resonance…
Larger multi-qubit quantum gates allow shallower, more efficient quantum circuits, which could decrease the prohibitive effect of noise on algorithms for noisy intermediate-scale quantum (NISQ) devices and fault-tolerant error correction…
An algebraic analysis of Grover's quantum search algorithm is presented for the case in which the initial state is an arbitrary pure quantum state of n qubits. This approach reveals the geometrical structure of the quantum search process,…
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate…
A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to…
We show how to construct an arbitrary robust one-qubit unitary operation with a control Hamiltonian of $A_x(t) \sigma_x + A_y(t) \sigma_y$, where $\sigma_i$ is a Pauli matrix and $A_i(t)$ is piecewise constant. Our method, based on planar…
Large-scale map construction plays a vital role in applications like autonomous driving and navigation systems. Traditional large-scale map construction approaches mainly rely on costly and inefficient special data collection vehicles and…
In this contribution we group the operator basis for d^2 dimensional Hilbert space in a way that enables us to relate bases of entangled states with single particle mutually unbiased state bases (MUB), each in dimensionality d. We utilize…
We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…
We propose a robust and computationally efficient algorithm to generically construct first return maps of dynamical systems from time series without the need for embedding. Typically, a first return map is constructed using a heuristic…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
Efficient quantum state preparation remains a central challenge in first-principles quantum simulations of dynamics in quantum field theories, where the Hilbert space is intrinsically infinite-dimensional. Here, we introduce a large…
This work focuses on optimizing the gates of a quantum circuit with a given topology to approximate the unitary time evolution governed by a Hamiltonian. Recognizing that unitary matrices form a mathematical manifold, we employ Riemannian…
We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…
Extending upon the observations of the emergence of quantum-like states from classical complex synchronized networks, this work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the…
Akin to the idea of complete sets of Mutually Unbiased Bases for prime dimensional Hilbert spaces, $\mathcal{H}_d$, we study its analogue for a $d$ dimensional subspace of $M (d,\mathbb{C})$, i.e. Mutually Unbiased Unitary Bases (MUUBs)…
Controlled unitary gates are a basic element in many quantum algorithms. Converting a general unitary $U$ with a known decomposition into its controlled version, controlled-$U$, can introduce a large overhead in terms of the depth of the…