Related papers: Generating the Kochen-Specker Sets with 36, 38 and…
Speaker counting is the task of estimating the number of people that are simultaneously speaking in an audio recording. For several audio processing tasks such as speaker diarization, separation, localization and tracking, knowing the…
A set of quantum measurements exhibits quantum contextuality when any consistent value assignment to the measurement outcomes leads to a contradiction with quantum theory. In the original Kochen-Specker-type of argument the measurement…
We discuss two new demonstrations of the Bell-Kochen-Specker theorem: a state-independent proof using 14 four-dimensional propositions, based on a suggestion made by Clifton, and a state-specific proof involving 5 propositions on the…
We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The…
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to…
Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices.…
A key requirement for an effective Quantum Error Correction (QEC) scheme is that the physical qubits have error rates below a certain threshold. The value of this threshold depends on the details of the specific QEC scheme, and its…
We show that there exist infinitely many $n \in \mathbb{Z}^+$ such that for any constant $\epsilon > 0$, any deterministic algorithm to solve $k$-\textsf{SAT} for $k \geq 3$ must perform at least…
We propose a new algorithm for k-means clustering in a distributed setting, where the data is distributed across many machines, and a coordinator communicates with these machines to calculate the output clustering. Our algorithm guarantees…
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm…
In this work, we propose a joint system combining a talking face generation system with a text-to-speech system that can generate multilingual talking face videos from only the text input. Our system can synthesize natural multilingual…
A quantum computer that stores information on two-state systems called quantum bits or qubits must be able to address and manipulate individual qubits, to effect coherent interactions between pairs of qubits, and to read out the value of…
We study quantum information properties of a seven-level system realized by a particle in an one-dimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We…
The Kochen-Specker theorem asserts the impossibility of assigning values to quantum quantities in a way that preserves functional relations between them. We construct a new type of valuation which is defined on all operators, and which…
A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
We introduce regular language states, a family of quantum many-body states. They are built from a special class of formal languages, called regular, which has been thoroughly studied in the field of computer science. They can be understood…
The output randomness from a random number generator can be certified by observing the violation of quantum contextuality inequalities based on the Kochen-Specker theorem. Contextuality can be tested in a single quantum system, which…
Several techniques of generating random quantum channels, which act on the set of $d$-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show under which conditions…