相关论文: Optimal reconstruction systems for erasures and fo…
The principle of maximum likelihood reconstruction has proven to yield satisfactory results in the context of quantum state tomography for many-body systems of moderate system sizes. Until recently, however, quantum state tomography has…
We introduce a protocol addressing the conformance test problem, which consists in determining whether a process under test conforms to a reference one. We consider a process to be characterized by the set of end-product it produces, which…
We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Solomon codes are over $\mathbb{F}_{q^\ell}$ and have…
Reaching a target quantum state from an initial state within a finite temporal window is a challenging problem due to non-adiabaticity. We study the optimal protocol for swithcing on interactions to reach the ground state of a weakly…
Precise device characterization is a fundamental requirement for a large range of applications using photonic hardware, and constitutes a multi-parameter estimation problem. Estimates based on measurements using single photons or classical…
Building large-scale quantum communication networks has its unique challenges. Here, we demonstrate that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We…
In this paper, we present a bootstrap procedure for general elliptic systems with $n(\geq 3)$ components. Combining with the $L^p$-$L^q$-estimates, it yields the optimal $L^\infty$-regularity conditions for the three well-known types of…
In Optimal Recovery, the task of learning a function from observational data is tackled deterministically by adopting a worst-case perspective tied to an explicit model assumption made on the functions to be learned. Working in the…
In this paper, we propose a general scale invariant approach for sparse signal recovery via the minimization of the $q$-ratio sparsity. When $1 < q \leq \infty$, both the theoretical analysis based on $q$-ratio constrained minimal singular…
In modern communication systems such as the Internet, random losses of information can be mitigated by oversampling the source. This is equivalent to expanding the source using overcomplete systems of vectors (frames), as opposed to the…
This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…
This work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called "threshold theorems" on the possibility…
The rates of quantum cryptographic protocols are usually expressed in terms of a conditional entropy minimized over a certain set of quantum states. In particular, in the device-independent setting, the minimization is over all the quantum…
We propose a new formalism to analyse the extremum structure of scale-invariant effective potentials. The problem is stated in a compact matrix form, used to derive general expressions for the stationary point equation and the mass matrix…
If primordial scalar and tensor perturbation spectra can be inferred from observations of the cosmic background radiation and large-scale structure, then one might hope to reconstruct a unique single-field inflaton potential capable of…
I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault…
We describe some pseudorandom properties of binary linear codes achieving capacity on the binary erasure channel under bit-MAP decoding (as shown in Kudekar et al this includes doubly transitive codes and, in particular, Reed-Muller codes).…
We derive a necessary and sufficient condition for the possibility of achieving the Heisenberg scaling in general adaptive multi-parameter estimation schemes in presence of Markovian noise. In situations where the Heisenberg scaling is…
The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which…
Affine transformations (dilatations and translations) are used to define a deformation of one-dimensional $N=2$ supersymmetric quantum mechanics. Resulting physical systems do not have conserved charges and degeneracies in the spectra.…