Related papers: A greedy algorithm for the identification of quant…

This paper presents several results on performance analysis for a class of uncertain linear quantum systems subject to either quadratic or non-quadratic perturbations in the system Hamiltonian. Also, coherent guaranteed cost controllers are…

Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…

While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…

A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…

The identification of environmental changes is crucial in many fields. The present research is aimed at investigating the optimal performance for detecting change points in a quantum system when its Hamiltonian suddenly changes at a…

A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…

Data-driven prediction in quantum mechanics consists in providing an approximative description of the motion of any particles at any given time, from data that have been previously collected for a certain number of particles under the…

We propose an iterative algorithm for incomplete quantum process tomography, with the help of quantum state estimation, based on the combined principles of maximum-likelihood and maximum-entropy. The algorithm yields a unique estimator for…

We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…

A new notion of controllability, eigenstate controllability, is defined for finite-dimensional bilinear quantum mechanical systems which are neither strongly completely controllably nor completely controllable. And a quantum control…

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…

We present a strategy to empirically determine the internal and control Hamiltonians for an unknown two-level system (black box) subject to various (piecewise constant) control fields when direct readout by measurement is limited to a…

We consider the task of intrinsic control system identification for quantum devices. The problem of experimental determination of subspace confinement is considered, and simple general strategies for full Hamiltonian identification and…

We consider how to characterize the dynamics of a quantum system from a restricted set of initial states and measurements using Bayesian analysis. Previous work has shown that Hamiltonian systems can be well estimated from analysis of noisy…

The advent of quantum computers has justified the development of quantum machine learning algorithms , based on the adaptation of the principles of machine learning to the formalism of qubits. Among such quantum algorithms, anomaly…

The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary…

The vast complexity is a daunting property of generic quantum states that poses a significant challenge for theoretical treatment, especially in non-equilibrium setups. Therefore, it is vital to recognize states which are locally less…

One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…

Difference sets are basic combinatorial structures that have applications in signal processing, coding theory, and cryptography. We consider the problem of identifying a shifted version of the characteristic function of a (known) difference…

The usual way to reveal properties of an unknown quantum state, given many copies of a system in that state, is to perform measurements of different observables and to analyze the measurement results statistically. Here we show that the…