Related papers: Entanglement-Resistant Two-Prover Interactive Proo…
The fusion of speech and language in the era of large language models has garnered significant attention. Discrete speech token is often utilized in text-to-speech tasks for speech compression and portability, which is convenient for joint…
This paper describes two intelligibility prediction systems derived from a pretrained noise-robust automatic speech recognition (ASR) model for the second Clarity Prediction Challenge (CPC2). One system is intrusive and leverages the hidden…
Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate…
We present three contributions to the understanding of QMA with multiple provers: 1) We give a tight soundness analysis of the protocol of [Blier and Tapp, ICQNM '09], yielding a soundness gap Omega(1/N^2). Our improvement is achieved…
A novel secure communication protocol is presented, based on an entangled pair of qubits and allowing asymptotically secure key distribution and quasi-secure direct communication. Since the information is transferred in a deterministic…
The integration of neural networks into safety-critical systems has shown great potential in recent years. However, the challenge of effectively verifying the safety of Neural Network Controlled Systems (NNCS) persists. This paper…
In a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first construction of a constant round zero-knowledge argument for NP secure against quantum attacks. However, their construction has several drawbacks compared to the…
A static non-linear homogeneous feedback for a fixed-time stabilization of a linear time-invariant (LTI) system is designed in such a way that the settling time is assigned exactly to a prescribed constant for all nonzero initial…
Noise can be considered the natural enemy of quantum information. An often implied benefit of high-dimensional entanglement is its increased resilience to noise. However, manifesting this potential in an experimentally meaningful fashion is…
Contrary to the conventional view that noise is detrimental, we show that mixed noise can protect entanglement in a two-atom-cavity system. Specifically, the leakage of the cavity and the stochastic atom-cavity couplings are modeled as two…
Whereas quantum complexity theory has traditionally been concerned with problems arising from classical complexity theory (such as computing boolean functions), it also makes sense to study the complexity of inherently quantum operations…
For a two-particle two-state system, sets of compatible propositions exist for which quantum mechanics and noncontextual hidden-variable theories make conflicting predictions for every individual system whatever its quantum state. This…
In this paper, we investigate the verification of dissipativity properties for polynomial systems without an explicitly identified model but directly from noise-corrupted measurements. Contrary to most data-driven approaches for nonlinear…
We propose a synthesis of the two proof styles of interactive theorem proving: the procedural style (where proofs are scripts of commands, like in Coq) and the declarative style (where proofs are texts in a controlled natural language, like…
We give a proof that entanglement purification, even with noisy apparatus, is sufficient to disentangle an eavesdropper (Eve) from the communication channel. In the security regime, the purification process factorises the overall initial…
We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It…
In multi-prover interactive proofs (MIPs), the verifier is usually non-adaptive. This stems from an implicit problem which we call ``contamination'' by the verifier. We make explicit the verifier contamination problem, and identify a…
Recently, it was argued that the binegativity might be a good quantifier of entanglement for two-qubit states. Like the concurrence and the negativity, the binegativity is also analytically computable quantifier for all two qubits. Based on…
A novel communication protocol based on an entangled pair of qubits is presented, allowing secure direct communication from one party to another without the need for a shared secret key. Since the information is transferred in a…
Given a quantum system $S$ entangled with another system $I$, the entanglement testing problem arises, prompting the identification of the system $S$ within a set of $m \ge 2$ identical systems. This scenario serves as a model for the…