Related papers: Short Multi-Prover Quantum Proofs for SAT without …
We consider the problem of certifying measurement incompatibility in a prepare-and-measure (PM) scenario. We present different families of sets of qubit measurements which are incompatible, but cannot lead to any quantum over classical…
In practical realizations of quantum information processing, there may exist noise in a measurement readout stage where errors appear not only on individual qubits but also on multiple ones collectively, the latter of which is called…
We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices.…
Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary…
Using the tool of concatenated stabilizer coding, we prove that the complexity class QMA remains unchanged even if every witness qubit is disturbed by constant noise. This result may not only be relevant for physical implementations of…
Multiple-choice question (MCQ) benchmarks have been a standard evaluation practice for measuring LLMs' ability to reason and answer knowledge-based questions. Through a synthetic NonsenseQA benchmark, we observe that different LLMs exhibit…
Quantum theory allows for correlations between the outcomes of distant measurements that are inconsistent with any locally causal theory, as demonstrated by the violation of a Bell inequality. Typical demonstrations of these correlations…
The coherent-state qubit is a promising candidate for optical quantum information processing due to its nearly-deterministic nature of the Bell-state measurement (BSM). However, its non-orthogonality incurs difficulties such as failure of…
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type methods that cap the possible advantage at only quadratic…
The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits…
Multi-photon emissions constitute a fundamental source of noise in quantum repeaters and other quantum communication protocols when probabilistic photon sources are employed. In this paper, it is shown that by alternating the Bell state…
We consider the problem of certifying binary observables based on a Bell inequality violation alone, a task known as self-testing of measurements. We introduce a family of commutation-based measures, which encode all the distinct…
In the field of monitored quantum circuits, it has remained an open question whether finite-time protocols for preparing long-range entangled states lead to phases of matter which are stable to gate imperfections, which can convert…
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…
We provide several advances to the understanding of the class of Quantum Merlin-Arthur proof systems (QMA), the quantum analogue of NP. Our central contribution is proving a longstanding conjecture that the Consistency of Local Density…
Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad implications in many areas of computer science and beyond. Quantum SAT solvers have been proposed in…
Quantum simulation, the study of strongly correlated quantum matter using synthetic quantum systems, has been the most successful application of quantum computers to date. It often requires determining observables with high precision, for…
We give an alternative proof of PreciseQMA = PSPACE, first proved by Fefferman and Lin (Innov. Theor. Comp. Sci. 2018), where PreciseQMA is the class Quantum Merlin-Arthur with inverse exponential completeness-soundness gap. We adapt the…
Quantum nondeterministic distributed computing was recently introduced as dQMA (distributed quantum Merlin-Arthur) protocols by Fraigniaud, Le Gall, Nishimura and Paz (ITCS 2021). In dQMA protocols, with the help of quantum proofs and local…
The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map…