Related papers: Shannon Perfect Secrecy in a Discrete Hilbert Spac…
The balance of gain and loss in an open system may maintain certain Hermitian dynamical behaviors, which can be hardly observed in a popular Hermitian system. In this paper, we systematically study a 1D PT -symmetry non-Hermitian SSH model…
Can we sense our location in an unfamiliar environment by taking a sublinear-size sample of our surroundings? Can we efficiently encrypt a message that only someone physically close to us can decrypt? To solve this kind of problems, we…
In differential privacy (DP), the generalized private testing problem was introduced by Liu and Talwar (STOC 2019). Given a dataset $X \in \mathcal{X}$ and a sequence of black-box $\varepsilon_t$-DP mechanisms $M_t:\mathcal{X}\to\{+1,-1\}$,…
We solve an open problem related to an optimal encoding of a straight line program (SLP), a canonical form of grammar compression deriving a single string deterministically. We show that an information-theoretic lower bound for representing…
We study a class of time-dependent (TD) non-Hermitian Hamiltonians $H(t)$ that can be transformed into a time-independent pseudo-Hermitian Hamiltonian $\mathcal{H}_{0}^{PH}$ using a suitable TD unitary transformation $F(t)$. The latter can…
Classical Hamiltonian spin systems are continuous dynamical systems on the symplectic phase space $(S^2)^n$. In this paper we investigate the underlying geometry of a time discretization scheme for classical Hamiltonian spin systems called…
In secure multi-party computations (SMC), parties wish to compute a function on their private data without revealing more information about their data than what the function reveals. In this paper, we investigate two Shannon-type questions…
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a…
This study considers the operator $\hat{T}$ corresponding to the classical spacetime four-volume $\tilde{T}$ (on-shell) of a finite patch of spacetime in the context of Unimodular Loop Quantum Cosmology for the homogeneous and isotropic…
We show that the strongly symmetric spectral convex compact sets are precisely the normalized state spaces of finite-dimensional simple Euclidean Jordan algebras and the simplices. Spectrality is the property that every state has a convex…
In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry,…
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…
Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size-$n$ permutation $\tau$ that avoids an arbitrary (and…
We give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
In [Z.-X. Liu, M. Liu, X.-G. Wen, arXiv:1101.5680], we studied 8 gapped symmetric quantum phases in S=1 spin chains %/ladders which respect a discrete spin rotation $D_2 \subset SO(3)$ and time reversal $T$ symmetries. In this paper, using…
Given an undirected unweighted graph $G$ and a source set $S$ of $|S| = \sigma $ sources, we want to build a data structure which can process the following query {\sc Q}$(s,t,e):$ find the shortest distance from $s$ to $t$ avoiding an edge…
It is known that the high-dimensional quantum state space is notoriously complicated in contrast with the beautiful Bloch ball of the qubit. We examined the mechanism behind this fact in the frame work of general probabilistic theory (GPT),…
We propose to realize one-dimensional topological phases protected by SU($N$) symmetry using alkali or alkaline-earth atoms loaded into a bichromatic optical lattice. We derive a realistic model for this system and investigate it…
We develop a geometric approach to stable homotopy groups of spheres in the spirit of the work of Pontrjagin and Rokhlin. A new proof of the Hopf Invariant One Theorem by J.F.Adams is obtained in all dimensions except 15 and 31. To prove…
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a…