Related papers: Rank lower bounds on non-local quantum computation
The non-local nature of the correlations possessed by quantum systems may be revealed by experimental demonstrations of the violation of Bell-type inequalities. Recent work has placed bounds on the correlations that quantum systems can…
The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings, 2014 -- which posits the existence of a local Hamiltonian with a super-constant quantum circuit lower bound on the complexity of all low-energy states --…
The quantum statistics mechanism is very powerful for investigating the equilibrium states and the phase transitions in complex spin disorder systems. The spin disorder systems act as an interdisciplinary platform for solving the optimum…
Impossibility of finding local realistic models for quantum correlations due to entanglement is an important fact in foundations of quantum physics, gaining now new applications in quantum information theory. We present an in-depth…
Quantum algorithms for optimization problems are of general interest. Despite recent progress in classical lower bounds for nonconvex optimization under different settings and quantum lower bounds for convex optimization, quantum lower…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
Measurement-based quantum computation (MQC) is a paradigm for studying quantum computation using many-body entanglement and single-qubit measurements. While MQC has inspired wide-ranging discoveries throughout quantum information, our…
First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are…
We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability…
Properties related to entanglement in quantum systems, are known to be associated with distinct properties of the corresponding classical systems, as for example stability, integrability and chaos. This means that the detailed topology,…
We establish connections between state tomography, pseudorandomness, quantum state synthesis, and circuit lower bounds. In particular, let $\mathfrak{C}$ be a family of non-uniform quantum circuits of polynomial size and suppose that there…
In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs.…
Developing autonomous agents that can interact with changing environments is an open challenge in machine learning. Robustness is particularly important in these settings as agents are often fit offline on expert demonstrations but deployed…
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently…
We perform numerical tests on quantum nonlocality of two-level quantum systems (qubits) observed by a uniformly moving observer. Under a suitable momentum setting, the quantum nonlocality of two-qubit nonmaximally entangled states could be…
In this work we make progress in understanding the relationship between learning models with access to entangled, separable and statistical measurements in the quantum statistical query (QSQ) model. To this end, we show the following…
The quest for fundamental test of quantum mechanics is an ongoing effort. We here address the question of what are the lowest possible moments needed to prove quantum nonlocality and noncontextuality without any further assumption -- in…
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively…
We introduce a hitherto unexplored form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly identify a subset of mutually orthogonal multipartite quantum…
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$,…