Related papers: Minimal sets of dequantizers and quantizers for fi…
For certain quantum operations acting on qubits, there exist bases of measurement operators such that estimating the average fidelity becomes efficient. The number of experiments required is then independent of system size and the classical…
We propose quantum devices that can realize probabilistically different projective measurements on a qubit. The desired measurement basis is selected by the quantum state of a program register. First we analyze the phase-covariant…
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…
The Quantum Query Model is a framework that allows us to express most known quantum algorithms. Algorithms represented by this model consist on a set of unitary operators acting over a finite Hilbert space, and a final measurement step…
We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one…
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
Four common optimality criteria for measurements are formulated using relations in the set of observables, and their connections are clarified. As case studies, 1-0 observables, localization observables, and photon counting observables are…
State estimation for discrete-time linear systems with quantized measurements is addressed. By exploiting the set-theoretic nature of the information provided by the quantizer, the problem is cast in the set membership estimation setting.…
The system identification problem is to estimate dynamical parameters from the output data, obtained by performing measurements on the output fields. We investigate system identification for quantum linear systems. Our main objectives are…
We explore set-stabilizability by constrained controls, and both controllability and stabilizability can be regarded as the special case of set-stabilizability. We not only clarify how to define an equilibrium point of Schr$\ddot{o}$dinger…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
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…
The use of d-state systems, or qudits, in quantum information processing is discussed. Three-state and higher dimensional quantum systems are known to have very different properties from two-state systems, i.e., qubits. In particular there…
Complete controllability of degenerate quantum system using quantum accessor modeled as a qubit chain with nearest neighborhood coupling is investigated. Sufficient conditions on the length of accessor and the way of coupling between…
In deep image compression, uniform quantization is applied to latent representations obtained by using an auto-encoder architecture for reducing bits and entropy coding. Quantization is a problem encountered in the end-to-end training of…
We study the thermodynamics of various physical systems in the framework of the Generalized Uncertainty Principle that implies a minimal length uncertainty proportional to the Planck length. We present a general scheme to analytically…
A method for analyzing the feature map for the kernel-based quantum classifier is developed; that is, we give a general formula for computing a lower bound of the exact training accuracy, which helps us to see whether the selected feature…
We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…