Related papers: Quantum interference as a resource for quantum spe…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Many technologies emerging from quantum information science heavily rely upon the generation and manipulation of entangled quantum states. Here, we propose and demonstrate a new class of quantum interference phenomena that arise when states…
Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as…
Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tasks, including quantum communication and quantum algorithms.…
Bell inequality violating entangled states are the working horse for many potential quantum information processing applications, including secret sharing, cryptographic key distribution and communication complexity reduction in distributed…
The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states…
A phase space formulation of the filtering process upon an incident quantum state is developed. This formulation can explain the results of both quantum interference and delayed-choice experiments without making use of the controversial…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
Fast moving classical variables can generate quantum mechanical behavior. We demonstrate how this can happen in a model. The key point is that in classically (ontologically) evolving systems one can still define a conserved quantum energy.…
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of…
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
Transmission through potential barriers is a fundamental problem in quantum mechanics. While semiclassical methods can approximate certain aspects of transmission, they fail to capture the intrinsically quantum interference associated with…
Entanglement lies at the heart of quantum mechanics and has no classical analogue. It is central to the speed up achieved by quantum algorithms over their classical counterparts. The Grover's search algorithm is one such algorithm which…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Recent work has exposed the idea that interesting quantum-like probability laws, including interference effects, can be manifest in classical systems. Here we propose a model for quantum-like (QL) states and QL bits. We suggest a way that…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It…
The advent of quantum computing has challenged classical conceptions of which problems are efficiently solvable in our physical world. This motivates the general study of how physical principles bound computational power. In this paper we…
Near-term quantum networks face a bottleneck due to low quantum communication rates. This degrades performance both by lowering operating speeds and increasing qubit storage time in noisy memories, making some quantum internet applications…