Related papers: New Quantum Algorithms for Computing Quantum Entro…
The operational structure of quantum couplings and entanglements is studied and classified for semifinite von Neumann algebras. We show that the classical-quantum correspondences such as quantum encodings can be treated as diagonal…
Precision control of quantum systems is the driving force for both quantum technology and the probing of physics at the quantum and nano-scale. We propose an implementation independent method for in situ quantum control that leverages…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality…
We address the task of compression of fermionic quantum information. Due to the parity superselection rule, differently from the case of encoding of quantum information in qubit states, part of the information carried by fermionic systems…
Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
Quantum simulation promises to address many challenges in fields ranging from quantum chemistry to material science, and high-energy physics, and could be implemented in noisy intermediate-scale quantum devices. A challenge in building good…
We study the computational complexity of estimating the quantum $\ell_{\alpha}$ distance ${\mathrm{T}_\alpha}(\rho_0,\rho_1)$, defined via the Schatten $\alpha$-norm $\|A\|_{\alpha} = \mathrm{tr}(|A|^{\alpha})^{1/\alpha}$, given…
Using the concept of von Neumann entropy, we quantify the information content of the various components of the quantum walk system, including the mutual information between its subsystems (coin and position) and use it to give a precise…
Estimation of Shannon and R\'enyi entropies of unknown discrete distributions is a fundamental problem in statistical property testing and an active research topic in both theoretical computer science and information theory. Tight bounds on…
This contribution features an accelerated computation of the Sinkhorn's algorithm, which approximates the Wasserstein transportation distance, by employing nonequispaced fast Fourier transforms (NFFT). The algorithm proposed allows…
We introduce a novel geometric approach to characterize entanglement relations in large quantum systems. Our approach is inspired by Schumacher's singlet state triangle inequality, which used an entropic-based distance to capture the…
One of the simplest and most effective classical machine learning algorithms is the $k$-nearest neighbors algorithm ($k$NN) which classifies an unknown test state by finding the $k$ nearest neighbors from a set of $M$ train states. Here we…
Block-encodings have become one of the most common oracle assumptions in the circuit model. I present an algorithm that uses von Neumann's measurement procedure to measure a phase, using time evolution on a block-encoded Hamiltonian as a…
Quantum metrology stands as a leading application of quantum science and technology, yet noise often constrains its precision and sensitivity. In near-term quantum metrology, existing protocols largely depend on virtual state purification,…
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem.…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
Computational fluid dynamics (CFD) is a cornerstone of classical scientific computing, and there is growing interest in whether quantum computers can accelerate such simulations. To date, the existing proposals for fault-tolerant quantum…