Related papers: On the relation between the subadditivity cone and…
The main concern of this paper is how to define proper measures of multipartite entanglement for mixed quantum states. Since the structure of partial separability and multipartite entanglement is getting complicated if the number of…
A general $n$-partite state $| \Psi>$ of a composite quantum system can be regarded as an element in a Hilbert tensor product space $\HH = \otimes_{k=1}^n \HH_k$, where the dimension of $\HH_k$ is $d_k$ for $k = 1,..., n$. Without loss of…
We present details on a physical realization, in a many-body Hamiltonian system, of the abstract probabilistic structure recently exhibited by Gell-Mann, Sato and one of us (C.T.), that the nonadditive entropy $S_q=k [1- Tr…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…
We approach the physical implications of the non-commutative nature of Complementary Observable Algebras (COA) from an information theoretic perspective. In particular, we derive a general \textit{entropic certainty principle} stating that…
While mutual information effectively quantifies dependence between two variables, it does not by itself reveal the complex, fine-grained interactions among variables, i.e., how multiple sources contribute redundantly, uniquely, or…
Symmetries and quantum anomalies serve as powerful tools for constraining complicated quantum many-body systems, offering valuable insights into low-energy characteristics based on their ultraviolet structure. Nevertheless, their…
We introduce "binding complexity", a new notion of circuit complexity which quantifies the difficulty of distributing entanglement among multiple parties, each consisting of many local degrees of freedom. We define binding complexity of a…
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as "strong subadditivity". For a field theory this inequality can be stated as follows: given any two regions of space $A$ and…
The relative entropy of two n-party quantum states is an important quantity exhibiting, for example, the extent to which the two states are different. The relative entropy of the states formed by reducing two n-party to a smaller number $m$…
Experimental and theoretical results about entropy limits for macroscopic and single-particle systems are reviewed. It is clarified when it is possible to speak about a quantum of entropy, given by the Boltzmann constant k, and about a…
We show that, as in the case of the principle of minimum action in classical and quantum mechanics, there exists an even more general principle in the very fundamental structure of {\it quantum space-time}: This is the principle of {\it…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
In this paper, we propose a low complexity quantum principal component analysis (qPCA) algorithm. Similar to the state-of-the-art qPCA, it achieves dimension reduction by extracting principal components of the data matrix, rather than all…
We consider a free quantum particle in one dimension whose mass profile exhibits jump discontinuities. The corresponding Hamiltonian is a self-adjoint realisation of the kinetic-energy operator, with the specific realisation determined by…
Silicon quantum computing has the potential to revolutionize technology with capabilities to solve real-life problems that are computationally complex or even intractable for modern computers [1] by offering sufficient high quality qubits…
This thesis consolidates, improves and extends the smooth entropy framework for non-asymptotic information theory and cryptography. We investigate the conditional min- and max-entropy for quantum states, generalizations of classical R\'enyi…
We consider the problem of private membership aggregation (PMA), in which a user counts the number of times a certain element is stored in a system of independent parties that store arbitrary sets of elements from a universal alphabet. The…
We introduce a quantity, called pseudo entropy, as a generalization of entanglement entropy via post-selection. In the AdS/CFT correspondence, this quantity is dual to areas of minimal area surfaces in time-dependent Euclidean spaces which…