Related papers: Playing quantum nonlocal games with six noisy qubi…
Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness, effectively playing the role of a "dice" at the heart of many device-independent cryptographic protocols. We show that there…
Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's…
The violations of Bell inequalities by measurements on quantum states give rise to the phenomenon of quantum non-locality and express the advantage of using quantum resources over classical ones for certain information-theoretic tasks. The…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
Modern supercomputers can handle resource-intensive computational and data-driven problems in various industries and academic fields. These supercomputers are primarily made up of traditional classical resources comprising CPUs and GPUs.…
We introduce a fresh scheme based on the local hidden variable models to quantify nonlocality for arbitrarily high-dimensional quantum systems. Our scheme explores the minimal amount of white noise that must be added to the system in order…
Quantum computing holds unparalleled potentials to enhance machine learning. However, a demonstration of quantum learning advantage has not been achieved so far. We make a step forward by rigorously establishing a noise-robust,…
The quest for quantum advantage, wherein quantum computers surpass the computational capabilities of classical computers executing state-of-the-art algorithms on well-defined tasks, represents a pivotal race in the domain of quantum…
It is critically important to analyze the achievability of quantum advantage under realistic imperfections. In this work, we show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only…
According to recent reports, the last loopholes in testing Bell's inequality are closed. It is argued that the really important task in this field has not been tackled yet and that the leading experiments claiming to close locality and…
First quantum computers very recently have demonstrated "quantum supremacy" or "quantum advantage": Executing a computation that would have been impossible on a classical machine. Today's quantum computers follow the NISQ paradigm: They…
The first generation of multi-qubit quantum technologies will consist of noisy, intermediate-scale devices for which active error correction remains out of reach. To exploit such devices, it is thus imperative to use passive error…
The future progress of semi-device independent quantum information science depends crucially on our ability to bound the strength of the nonlocal correlations achievable with finite dimensional quantum resources. In this work, we…
The parity game is an example of a nonlocal game: by sharing a Greenberger-Horne-Zeilinger (GHZ) state before playing this game, the players can win with a higher probability than is allowed by classical physics. The GHZ state of $N$ qubits…
Quantumgametheoryextendsclassical strategic decision-making by incorporating quantum superposition, entanglement, and measurement-induced randomness into competitive interactions. This paper introduces a team-based Quantum Sabotage Game…
A key problem in the field of quantum computing is understanding whether quantum machine learning (QML) models implemented on noisy intermediate-scale quantum (NISQ) machines can achieve quantum advantages. Recently, Huang et al. [Nat…
It remains an open question whether every pure multipartite state that is genuinely entangled is also genuinely nonlocal. Recently, a new general construction of Bell inequalities allowing the detection of genuine multipartite nonlocality…
Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently…
A scheme for distributed quantum measurement that allows nondestructive or indirect Bell measurement was proposed by Gupta et al., (Int. J. Quant. Infor. \textbf{5} (2007) 627) and subsequently realized experimentally using an NMR-based…
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…