Related papers: Short Multi-Prover Quantum Proofs for SAT without …
Large language models (LLMs) are increasingly used for tasks that implicitly reduce to Boolean satisfiability (SAT), yet their reasoning ability on SAT remains unclear. We present a systematic study of LLMs on 2-SAT and 3-SAT, together with…
Quantum sensing holds great promise for high-precision magnetic field measurements. However, its performance is significantly limited by noise. The investigation of active quantum error correction to address this noise led to the…
Quantum learning from state samples is often benchmarked in a fixed-budget paradigm, relating error to a prescribed number of copies. We instead adopt a stopping-time viewpoint: in minimal-feedback learning, the learning completion can be…
Quantum machine learning (QML) leverages quantum computing for classical inference, furnishes the processing of quantum data with machine-learning methods, and provides quantum algorithms adapted to noisy devices. Typically, QML proposals…
In this paper, we extend the protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev to make the verification efficient. Our result is obtained in the following three steps: $\bullet$ We show that…
The stability of several clock protocols based on 2 to 20 entangled atoms is evaluated numerically by a simulation that includes the effect of decoherence due to classical oscillator noise. In this context the squeezed states discussed by…
Measurement based quantum computation (MBQC) is an effective paradigm for universal quantum computation. In this scheme, the universal set of quantum gates are realized by only local measurements on the prior prepared cluster states. The…
Quantum secret sharing (QSS) plays a pivotal role in multiparty quantum communication, ensuring the secure distribution of private information among multiple parties. However, the security of QSS schemes can be compromised by attacks…
Despite the fundamental role the Quantum Satisfiability (QSAT) problem has played in quantum complexity theory, a central question remains open: At which local dimension does the complexity of QSAT transition from "easy" to "hard"? Here, we…
Quantum hardware is advancing rapidly across various platforms, yet implementing large-scale quantum error correction (QEC) remains challenging. As hardware continues to improve, there is a growing need to identify potential applications on…
In this paper, we introduce a class of highly entangled real quantum states that cannot be approximated by circuits with $\log$-many non-Clifford gates and prove that Bell sampling enables efficient cross-device verification (or distributed…
Recently, a novel framework for semi-device-independent quantum prepare-and-measure protocols has been proposed, based on the assumption of a limited distinguishability between the prepared quantum states. Here, we discuss the problem of…
We present a modular error mitigation protocol for running $\mathsf{BQP}$ computations on a quantum computer with time-dependent noise. Utilising existing tools from quantum verification and measurement-based quantum computation, our…
Testing and verifying imperfect multi-qubit quantum devices are important as such noisy quantum devices are widely available today. Bell inequalities are known useful for testing and verifying the quality of the quantum devices from their…
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also…
Quantum effects in metrology can in principle enhance measurement precision from the so-called standard quantum limit to the Heisenberg Limit. Further advancements in quantum metrology largely rely on innovative metrology protocols that can…
The intrinsic non-locality of correlations in Quantum Mechanics allow us to certify the behaviour of a quantum mechanism in a device independent way. In particular, we present a new protocol that allows an unbounded amount of randomness to…
We propose a quantum-state-certification protocol for stabilizer states, motivated by application in in-situ testing of NISQ-era quantum computer systems: The number of qubits is bounded, and in terms of cost of running the protocol,…
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…
Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a…