Related papers: Minimal Bell-Kochen-Specker proofs with POVMs on q…
The $MLS$ conjecture states that every finite simple group has a minimal logarithmic signature. The aim of this paper is proving the existence of a minimal logarithmic signature for some simple unitary groups $PSU_{n}(q)$. We report a gap…
Self-testing of quantum devices based on observed measurement statistics is a method to certify quantum systems using minimal resources. In Ref. [Phys. Rev. \textbf{A} 101, 032106 (2020)], a scheme based on observing measurement statistics…
We present, and analyze thoroughly, a highly symmetric and efficient scheme for the determination of a single-qubit state, such as the polarization properties of photons emitted by a single-photon source. In our scheme there are only four…
Self-testing is a promising approach to certifying quantum states or measurements. Originally, it relied solely on the outcome statistics of the measurements involved in a device-independent (DI) setup. Extra physical assumptions about the…
Quantum fidelity is a measure to quantify the closeness of two quantum states. In an operational sense, it is defined as the minimal overlap between the probability distributions of measurement outcomes and the minimum is taken over all…
In a proof of knowledge (PoK), a verifier becomes convinced that a prover possesses privileged information. In combination with zero-knowledge proof systems, PoKs play an important role in security protocols such as in digital signatures…
We present graphical representation for genaralized quantum measurements (POVM). We represent POVM elements as Bloch vectors and find the conditions these vectors should satisfy in order to describe realizable physical measurements. We show…
We study the minimal input sets which can determine completely the universal and the phase-covariant quantum cloning machines. We find that the universal quantum cloning machine, which can copy arbitrary input qubit equally well, however…
A well-known problem in the theory of polynomials over finite fields is the characterization of minimal value set polynomials (MVSPs) over the finite field $\mathbb{F}_q$, where $q = p^n$. These are the nonconstant polynomials $F \in…
Recently a characterization of uniformly continuous POVMs and a necessary condition for a uniformly continuous POVM $F$ to have the norm-1 property have been provided. Moreover it was proved that in the commutative case, uniform continuity…
The Kochen-Specker theorem is a fundamental result in quantum foundations that has spawned massive interest since its inception. We show that within every Kochen-Specker graph, there exist interesting subgraphs which we term $01$-gadgets,…
We consider general prepare-and-measure scenarios in which Alice can transmit qubit states to Bob, who can perform general measurements in the form of positive operator-valued measures (POVMs). We show that the statistics obtained in any…
We prove lower bounds for the Minimum Circuit Size Problem (MCSP) in the Sum-of-Squares (SoS) proof system. Our main result is that for every Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$, SoS requires degree $\Omega(s^{1-\epsilon})$…
We propose a simple proof of the vertical half-space theorem for Heisenberg space.
The objective of this work is to develop a recursive, discrete time quantum filtering equation for a system that interacts with a probe, on which measurements are performed according to the Positive Operator Valued Measures (POVMs)…
It is pointed out that the 60 complex rays in four dimensions associated with a system of two qubits yield over 10^9 critical parity proofs of the Kochen-Specker theorem. The geometrical properties of the rays are described, an overview of…
Let $P$ and $Q$ be idempotents on a Hilbert space $\mathcal{H}.$ The minus order $P\preceq Q$ is defined by the equation $PQ=QP=P.$ In this note, we first present some necessary and sufficient conditions for which the supremum and infimum…
In this paper we survey with complete proofs some well--known, but hard to find, results about constructing closed embedded minimal surfaces in a closed 3-dimensional manifold via min--max arguments. This includes results of J. Pitts, F.…
We consider the problem of certifying binary observables based on a Bell inequality violation alone, a task known as self-testing of measurements. We introduce a family of commutation-based measures, which encode all the distinct…
We consider binary abelian codes of length $p^m q^n$, where $p$ and $q$ are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or…