Related papers: Linear Programming Bounds on $k$-Uniform States
The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes, logical qubits can be redundantly encoded in a set…
The negative solution to the famous problem of $36$ officers of Euler implies that there are no two orthogonal Latin squares of order six. We show that the problem has a solution, provided the officers are entangled, and construct…
In unitary property testing a quantum algorithm, also known as a tester, is given query access to a black-box unitary and has to decide whether it satisfies some property. We propose a new technique for proving lower bounds on the quantum…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is {\em impossible} to do so if the transformation is anti-linear and…
Let $l$ be a rational prime greater than or equal to $3$ and $k$ be a given positive integer. Under a conjecture due to Langland and an assumption on upper bound for the regulator of fields of the form $\mathbb{Q}\left(\sqrt[l]a\right)$, we…
A pure quantum state of N subsystems with d levels each is called k-multipartite maximally entangled state, written k-uniform, if all its reductions to k qudits are maximally mixed. These states form a natural generalization of N-qudits GHZ…
We study the properties of {\bf exact} (all level $k$) quantum coherent states in the context of string theory on a group manifold (WZWN models). Coherent states of WZWN models may help to solve the unitarity problem: Having positive norm,…
Several researchers, including Leonid Levin, Gerard 't Hooft, and Stephen Wolfram, have argued that quantum mechanics will break down before the factoring of large numbers becomes possible. If this is true, then there should be a natural…
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…
Quantum speed limit (QSL) is a fundamental concept in quantum mechanics and provides a lower bound on the evolution time. The attainability of QSL, greatly depending on the understanding of QSL, is a long-standing open problem especially…
We consider the problem of estimating the state of a large but finite number $N$ of identical quantum systems. In the limit of large $N$ the problem simplifies. In particular the only relevant measure of the quality of the estimation is the…
Quantum speed limit (QSL) is the study of fundamental limits on the evolution time of quantum systems. For instance, under the action of a time-independent Hamiltonian, the evolution time between an initial and a final quantum state obeys…
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
Unambiguous measurements play an important role in quantum information, with applications ranging from quantum key distribution to quantum state reconstruction. Recently, such measurements have also been used in quantum algorithms based on…
We show the existence of uniformly bounded sequences of increasing numbers of orthonormal sections of powers $L^k$ of a positive holomorphic line bundle $L$ on a compact K\"ahler manifold $M$. In particular, we construct for each positive…
We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions, linear right hand side functions, and a constant coefficient matrix, as well as their symmetric dual. We search for…
An entangled state is said to be $m$-uniform if the reduced density matrix of any $m$ qubits is maximally mixed. This is intimately linked to pure quantum error correction codes (QECCs), which allow not only to correct errors, but also to…
One-dimensional particle states are constructed according to orthogonality conditions, without requiring boundary conditions. Free particle states are constructed using Dirac's delta function orthogonality conditions. The states (doublets)…
We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest…