Search results for "quant-ph"
showing 10 items of 1378 documents
Heat flux dynamics in dissipative cascaded systems
2014
We study the dynamics of heat flux in the thermalization process of a pair of identical quantum system that interact dissipatively with a reservoir in a {\it cascaded} fashion. Despite the open dynamics of the bipartite system S is globally Lindbladian, one of the subsystems "sees" the reservoir in a state modified by the interaction with the other subsystem and hence it undergoes a non-Markovian dynamics. As a consequence, the heat flow exhibits a non-exponential time behaviour which can greatly deviate from the case where each party is independently coupled to the reservoir. We investigate both thermal and correlated initial states of $S$ and show that the presence of correlations at the …
Work extraction exploiting thermalization with a single bath
2018
We propose a protocol which exploits the collective thermalisation of a bipartite system to extract work from another system. The protocol is based on a recently proposed work definition not requiring measurements and involving the presence of a single bath. A general description of the protocol is provided without specifying the characteristics of the bipartite system. We quantify both the extracted work and the ideal efficiency of the process also giving a maximum bound to the extracted work. Then, we apply the protocol to the case when the bipartite system is governed by the Rabi Hamiltonian while using a zero temperature bath. For very strong couplings, an extraction of work comparable …
Superadiabatic dynamics in open quantum systems
2013
We extend the concept of superadiabatic dynamics, or transitionless quantum driving, to quantum open systems whose evolution is governed by a master equation in the Lindblad form. We provide the general framework needed to determine the control strategy required to achieve superadiabaticity. We apply our formalism to two examples consisting of a two-level system coupled to environments with time-dependent bath operators.
Span programs and quantum algorithms for st-connectivity and claw detection
2012
We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T…
Span Programs for Functions with Constant-Sized 1-certificates
2011
Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity $O(n^{35/27})$ that is better than $O(n^{13/10})$ of the best…
Quantum lower bounds for the set equality problems
2003
The set equality problem is to decide whether two sets $A$ and $B$ are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set quality problem. It was an open problem to find any $w(1)$ query lower bound when sets $A$ and $B$ are given by quantum oracles with functions $a$ and $b$. We will prove $\Omega(\frac{n^{1/3}}{\log^{1/3} n})$ lower bound for the set equality problem when the set of the preimages are very small for every element in $A$ and $B$.
Strong supremacy of quantum systems as communication resource
2017
We investigate the task of $d$-level random access codes ($d$-RACs) and consider the possibility of encoding classical strings of $d$-level symbols (dits) into a quantum system of dimension $d'$ strictly less than $d$. We show that the average success probability of recovering one (randomly chosen) dit from the encoded string can be larger than that obtained in the best classical protocol for the task. Our result is intriguing as we know from Holevo's theorem (and more recently from Frenkel-Weiner's result [Commun. Math. Phys. 340, 563 (2015)]) that there exist communication scenarios wherein quantum resources prove to be of no advantage over classical resources. A distinguishing feature of…
Exceptional configurations of quantum walks with Grover's coin
2015
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's diffusion transformation - has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. This extends the class of known exceptional configurations; until now the only known such configuration was the "diagonal construction" by Ambainis and Rivosh [AR08]
Quantum Random Access Codes with Shared Randomness
2008
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p > 1/2 is not possible. We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p > 1/2 exists for any n > 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1…
Entanglement-Enhanced Classical Communication
2008
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to introduce a consistent formalism of the quantum theory, as well as to review fundamental facts about quantum non-locality and how it can be used to enhance communication. Moreover, this reflects my dwelling in the spirit of classical information theory, and it is intended to be a starting point towards a thorough study of how quantum technologies can help to shape the future of telecommunications. Whenever it was possible, heuristic reasonings were introduced…