Related papers: Designs from Local Random Quantum Circuits with SU…
This paper studies the control-oriented identification problem of set-valued moving average systems with uniform persistent excitations and observation noises. A stochastic approximation-based (SA-based) algorithm without projections or…
We study the application of the generalized convolution quadrature (gCQ) based on Runge--Kutta methods to approximate the solution of an important class of sectorial problems. The gCQ generalizes Lubich's original convolution quadrature…
The symmetry SU(2) and its geometric Bloch Sphere rendering are familiar for a qubit (spin-1/2) but extension of symmetries and geometries have been investigated far less for multiple qubits, even just a pair of them, that are central to…
Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in…
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such…
The Symmetric group $S_{n}$ manifests itself in large classes of quantum systems as the invariance of certain characteristics of a quantum state with respect to permuting the qubits. The subgroups of $S_{n}$ arise, among many other…
Recently introduced dual unitary brickwork circuits have been recognised as paradigmatic exactly solvable quantum chaotic many-body systems with tunable degree of ergodicity and mixing. Here we show that regularity of the circuit lattice is…
In this paper, we study time-optimal control problems related to system of two coupled qubits where the time scales involved in performing unitary transformations on each qubit are significantly different. In particular, we address the case…
A generalized Hubbard-Stratonovitch transformation relating an integral over random unitary N times N matrices to an integral over Efetov's unitary sigma model manifold, is introduced. This transformation adapts the supersymmetry method to…
A unitary state $t$-design is an ensemble of pure quantum states whose moments match up to the $t$-th order those of states uniformly sampled from a $d$-dimensional Hilbert space. Typically, unitary state $t$-designs are obtained by…
Quantum computing presents a promising approach for machine learning with its capability for extremely parallel computation in high-dimension through superposition and entanglement. Despite its potential, existing quantum learning…
$k$-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact $k$-uniform states or…
In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a {\it{unified}} way. The Lagrangian of a SQC reveals the constraints, that are…
Sample-based quantum diagonalization (SQD) is a hybrid quantum-classical algorithm for estimating ground-state energies in electronic-structure calculations. It uses a quantum processor as a sampler to construct a variational subspace, with…
Conformation generation, also known as molecular unfolding (MU), is a crucial step in structure-based drug design, remaining a challenging combinatorial optimization problem. Quantum annealing (QA) has shown great potential for solving…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
In this paper, we introduce stochastic simulated quantum annealing (SSQA) for large-scale combinatorial optimization problems. SSQA is designed based on stochastic computing and quantum Monte Carlo, which can simulate quantum annealing (QA)…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective…
Recent years have enjoyed a strong interest in exploring properties and applications of random quantum circuits. In this work, we explore the ensemble of $t$-doped Clifford circuits on $n$ qubits, consisting of Clifford circuits…