Related papers: A complexity theory for non-local quantum computat…
We construct a theory for long-distance quantum communication based on sharing entanglement through a linear chain of $N$ elementary swapping segments of length~$L=Nl$ where $l$ is the length of each elementary swap setup. Entanglement…
From the partition function for two classes of classically non-local actions containing the fractional Laplacian, we show that as long as there exists a suitable (non-local) Hilbert-space transform the underlying action can be mapped onto a…
We introduce the lookahead-bounded Q-learning (LBQL) algorithm, a new, provably convergent variant of Q-learning that seeks to improve the performance of standard Q-learning in stochastic environments through the use of ``lookahead'' upper…
We present recent developments of the NTChem program for performing large scale hybrid Density Functional Theory calculations on the supercomputer Fugaku. We combine these developments with our recently proposed Complexity Reduction…
We previously established that in principle, it is possible to quantum compute using passive linear optics with photo-detectors (quant-ph/0006088). Here we describe techniques based on error detection and correction that greatly improve the…
Remote entanglement enables coordinated decision making without communication and produces correlations beyond those achievable by any classical strategy, representing a practical quantum advantage in time-critical distributed…
We probe the theoretical connection among three different approaches to analyze the entanglement of identical particles, i.e., the first quantization language (1QL), elementary-symmetric/exterior products (which has the mathematical…
In quantum thermodynamics, understanding the interplay between locality, thermal constraints, and communication remains an open challenge. In this manuscript, we introduce Local Thermal Operations and Classical Communication (LTOCC), a…
Shared randomness is a valuable resource in distributed computing, allowing some form of coordination between processors without explicit communication. But what happens when the shared random string can affect the inputs to the system?…
Non-locality stands nowadays not only as one of the cornerstones of quantum theory, but also plays a crucial role in quantum information processing. Several experimental investigations of nonlocality have been carried out over the years. In…
Quantum information and communication processing within quantum networks usually employs identical particles. Despite this, the physical role of quantum statistical nature of particles in large-scale networks remains elusive. Here, we show…
By leveraging quantum-mechanical properties like superposition, entanglement, and interference, quantum computing (QC) offers promising solutions for problems that classical computing has not been able to solve efficiently, such as drug…
Executing quantum algorithms over distributed quantum systems requires quantum circuits to be divided into sub-circuits which communicate via entanglement-based teleportation. Naively mapping circuits to qubits over multiple quantum…
Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. However, entanglement detection and quantification are believed to be hard due to the operational impracticality of existing…
In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more…
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the…
Instantaneous two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement, and the nonlocal interactions are limited to simultaneous classical communication in both…
Parameterized complexity theory offers a framework for a refined analysis of hard algorithmic problems. Instead of expressing the running time of an algorithm as a function of the input size only, running times are expressed with respect to…
We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures like quantum discord and quantum work deficit in two qubits and higher dimensional systems. We show that determination of…
Encoding and decoding quantum information in a multipartite quantum system are indispensable for quantum error correction and also play crucial roles in multiparty tasks in distributed quantum information processing such as quantum secret…