Related papers: Short Multi-Prover Quantum Proofs for SAT without …
We propose a simple protocol for the verification of quantum computation after the computation has been performed. Our construction can be seen as an improvement on previous results in that it requires only a single prover, who is…
Making use of coherence and entanglement as metrological quantum resources allows to improve the measurement precision from the shot-noise- or quantum limit to the Heisenberg limit. Quantum metrology then relies on the availability of…
Self-testing protocols enable the certification of quantum systems in a device-independent manner, i.e. without knowledge of the inner workings of the quantum devices under test. Here, we demonstrate this high standard for characterization…
Quantum error correction is essential for reliable quantum computation, where surface codes demonstrate high fault-tolerant thresholds and hardware efficiency. However, noise in single-shot measurements limits logical readout fidelity,…
Quantum computation will rely on quantum error correction to counteract decoherence. Successfully implementing an error correction protocol requires the fidelity of qubit operations to be well-above error correction thresholds. In…
Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired…
We propose a protocol for countering the effects of dephasing in quantum state transfer over a noisy spin channel weakly coupled to the sender and receiver qubits. Our protocol, based on performing regular global measurements on the…
The preparation of long-range entangled states using unitary circuits is limited by Lieb-Robinson bounds, but circuits with projective measurements and feedback (``adaptive circuits'') can evade such restrictions. We introduce three classes…
Capacitively coupled semiconductor spin qubits hold promise as the building blocks of a scalable quantum computing architecture with long-range coupling between distant qubits. However, the two-qubit gate fidelities achieved in experiments…
We consider joint measurement of two and three unsharp qubit observables through an Arthur-Kelly type joint measurement model for qubits. We investigate the effect of initial state of the detectors on the unsharpness of the measurement as…
Quantum sensors outperform their classical counterparts in their estimation precision, given the same amount of resources. So far, quantum-enhanced sensitivity has been achieved by exploiting the superposition principle. This enhancement…
We present a simple proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code (QECC) with its ability to achieve a universal set of transversal logical gates. Our derivation employs…
We attempt to propose the first orthogonal-state-based protocols of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping…
Given that reliable cloud quantum computers are becoming closer to reality, the concept of delegation of quantum computations and its verifiability is of central interest. Many models have been proposed, each with specific strengths and…
A precise measurement of dephasing over a range of timescales is critical for improving quantum gates beyond the error correction threshold. We present a metrological tool, based on randomized benchmarking, capable of greatly increasing the…
We present methods and results of shot-by-shot correlation of noisy measurements to extract entangled state and process tomography in a superconducting qubit architecture. We show that averaging continuous values, rather than counting…
We consider the problem of the classical simulation of quantum measurements in the scenario of communication complexity. Regev and Toner (2007) have presented a 2-bit protocol which simulates one particular correlation function arising from…
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The first variant is one in which the verifier sends a short…
Several techniques have been recently introduced to mitigate errors in near-term quantum computers without the overhead required by quantum error correcting codes. While most of the focus has been on gate errors, measurement errors are…
It is not so well-known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite the potential advantages of using such protocols in terms of the relaxation of accuracy,…