Related papers: QMA with subset state witnesses
This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time…
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al.,…
Quantum systems can be prepared in an infinite continuum of states, but only some of them can be used as resources for quantum technologies. Discerning whether a specific quantum state falls into this class, is often a challenging task. We…
We investigate the difficulties that undergraduate students in quantum mechanics courses have in transferring learning from previous courses or within the same course from one context to another by administering written tests and conducting…
The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…
We investigate the issue of finding common entanglement witness for certain class of states and extend this study to the case of Schmidt number witnesses. We also introduce the notion of common decomposable and non-decomposable witness…
Many protocols and tasks in quantum information science rely inherently on the fundamental notion of contextuality to provide advantages over their classical counterparts, and contextuality represents one of the main differences between…
We propose a family of positive maps constructed from a recently introduced class of symmetric measurements. These maps are used to define entanglement witnesses, which include other popular approaches with mutually unbiased bases and…
We present a null witness of the dimension of a quantum system, discriminating real, complex and classical spaces, based on equality due to linear independence. The witness involves only a single measurement with sufficiently many outcomes…
Quantum Machine Learning (QML) hasn't yet demonstrated extensively and clearly its advantages compared to the classical machine learning approach. So far, there are only specific cases where some quantum-inspired techniques have achieved…
Entanglement witnesses provide tools to detect entanglement in experimental situations without the need of having full tomographic knowledge about the state. If one estimates in an experiment an expectation value smaller than zero, one can…
We present very simple method for constructing indecomposable entanglement witnesses out of a given pair -- an entanglement witness W and the corresponding state detected by W. This method may be used to produce new classes of atomic…
While seemingly undesirable, it is not a surprising fact that there are certain problems for which quantum computers offer no computational advantage over their respective classical counterparts. Moreover, there are problems for which there…
It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\textit{de facto}$ computational task to study in complexity theory. In…
The quantum nature of a black hole is revealed using the simplest terms that one learns in undergraduate and beginning graduate courses. The exposition demonstrates -- vividly -- the importance and power of the quantum oscillator in…
Quantum Machine Learning (QML) is an exciting tool that has received significant recent attention due in part to advances in quantum computing hardware. While there is currently no formal guarantee that QML is superior to classical ML for…
Standard quantum inference converts quantum data into classical outputs. We study an alternative inference setting in which the desired output is quantum, preserving coherence. Such settings include quantum purity amplification (QPA),…
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited number of applications requiring contextuality but not entanglement. Here, we show that for any quantum state and observables of…
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum…
We investigate the classical aspects of Quantum theory and under which description Quantum theory does appear Classical. Although such descriptions or variables are known as "ontological" or "hidden", they are not hidden at all, but are…