Related papers: A slightly improved upper bound for quantum statis…
As stakeholders and policy makers increasingly rely upon quantitative predictions from advanced computational models, a problem of fundamental importance is the quantification and reduction of uncertainties in both model inputs and output…
Elliptic Curve Cryptography (ECC) is an attractive alternative to conventional public key cryptography, such as RSA. ECC is an ideal candidate for implementation on constrained devices where the major computational resources i.e. speed,…
We study the problem of training and certifying adversarially robust quantized neural networks (QNNs). Quantization is a technique for making neural networks more efficient by running them using low-bit integer arithmetic and is therefore…
Entanglement lies at the heart of quantum information science, serving as a key resource for quantum communication, computation, and metrology. Consequently, high-precision entangled state preparation and efficient verification are…
We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…
The quantum statistics mechanism is very powerful for investigating the equilibrium states and the phase transitions in complex spin disorder systems. The spin disorder systems act as an interdisciplinary platform for solving the optimum…
In the highly non-Gaussian regime, the quantum Ziv-Zakai bound (QZZB) provides a lower bound on the available precision, demonstrating the better performance compared with the quantum Cram\'er-Rao bound. However, evaluating the impact of a…
As a natural extension of the SAT problem, an array of proof systems for quantified Boolean formulas (QBF) have been proposed, many of which extend a propositional proof system to handle universal quantification. By formalising the…
Uncertainty Quantification (UQ) research has primarily focused on closed-book factual question answering (QA), while contextual QA remains unexplored, despite its importance in real-world applications. In this work, we focus on UQ for the…
Randomized Kaczmarz (RK) is a simple and fast solver for consistent overdetermined systems, but it is known to be fragile under noise. We study overdetermined $m\times n$ linear systems with a sparse set of corrupted equations, $ {\bf…
We introduce a quantifier of phase-space complexity for discrete-variable (DV) quantum systems. Motivated by a recent framework developed for continuous-variable systems, we construct a complexity measure of quantum states based on the…
We consider estimation of a single unknown parameter embedded in a quantum state. Quantum Cram\'er-Rao bound (QCRB) is the ultimate limit of the mean squared error for any unbiased estimator. While it can be achieved asymptotically for a…
Benchmarking the performance of quantum error correction codes in physical systems is crucial for achieving fault-tolerant quantum computing. Current methodologies, such as (shadow) tomography or direct fidelity estimation, fall short in…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
Quantum secret sharing (QSS) enables secure distribution of information among multiple parties but remains vulnerable to noise. We analyze the effects of bit-flip, phase-flip, and amplitude damping noise on the multiparty QSS for classical…
We provide an alternative proof of \class{QIP}=\class{PSPACE} to the recent breakthrough result. Unlike solving some semidefinite programs that captures the computational power of quantum interactive proofs, our method starts with one…
One of the key steps in quantum algorithms is to prepare an initial quantum superposition state with different kinds of features. These so-called state preparation algorithms are essential to the behavior of quantum algorithms, and…
As quantum technologies mature, the development of tools for benchmarking their ability to prepare and manipulate complex quantum states becomes increasingly necessary. A key concept, the state overlap between two quantum states, offers a…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
Zero-Knowledge Proofs (ZKPs) have emerged as an important cryptographic technique allowing one party (prover) to prove the correctness of a statement to some other party (verifier) and nothing else. ZKPs give rise to user's privacy in many…