Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userGeneral impossible operations in quantum information
66
0
0.0
(
0
)
Authors
Arun K. Pati
Ask ChatGPT about the research
No Arabic abstract
We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations.
rate research
Read More
We consider the evolution of an arbitrary quantum dynamical semigroup of a finite-dimensional quantum system under frequent kicks, where each kick is a generic quantum operation. We develop a generalization of the Baker-Campbell-Hausdorff formula allowing to reformulate such pulsed dynamics as a continuous one. This reveals an adiabatic evolution. We obtain a general type of quantum Zeno dynamics, which unifies all known manifestations in the literature as well as describing new types.
We describe a general approach to proving the impossibility of implementing a quantum channel by local operations and classical communication (LOCC), even with an infinite number of rounds, and find that this can often be demonstrated by solving a set of linear equations. The method also allows one to design an LOCC protocol to implement the channel whenever such a protocol exists in any finite number of rounds. Perhaps surprisingly, the computational expense for analyzing LOCC channels is not much greater than that for LOCC measurements. We apply the method to several examples, two of which provide numerical evidence that the set of quantum channels that are not LOCC is not closed and that there exist channels that can be implemented by LOCC either in one round or in three rounds that are on the boundary of the set of all LOCC channels. Although every LOCC protocol must implement a separable quantum channel, it is a very difficult task to determine whether or not a given channel is separable. Fortunately, prior knowledge that the channel is separable is not required for application of our method.
I derive a tight bound between the quality of estimating the state of a single copy of a $d$-level system, and the degree the initial state has to be altered in course of this procedure. This result provides a complete analytical description of the quantum mechanical trade-off between the information gain and the quantum state disturbance expressed in terms of mean fidelities. I also discuss consequences of this bound for quantum teleportation using nonmaximally entangled states.
When scheduling quantum operations, a shorter overall execution time of the resulting schedule yields a better throughput and higher fidelity output. In this paper, we demonstrate that quantum operation scheduling can be interpreted as a special type of job-shop problem. On this basis, we provide its formulation as Constraint Programming while taking into account commutation between quantum operations. We show that this formulation improves the overall execution time of the resulting schedules in practice through experiments with a real quantum compiler and quantum circuits from two common benchmark sets.
We consider an infinite class of unambiguous quantum state discrimination problems on multipartite systems, described by Hilbert space $cal{H}$, of any number of parties. Restricting consideration to measurements that act only on $cal{H}$, we find the optimal global measurement for each element of this class, achieving the maximum possible success probability of $1/2$ in all cases. This measurement turns out to be both separable and unique, and by our recently discovered necessary condition for local quantum operations and classical communication (LOCC), it is easily shown to be impossible by any finite-round LOCC protocol. We also show that, quite generally, if the input state is restricted to lie in $cal{H}$, then any LOCC measurement on an enlarged Hilbert space is effectively identical to an LOCC measurement on $cal{H}$. Therefore, our necessary condition for LOCC demonstrates directly that a higher success probability is attainable for each of these problems using general separable measurements as compared to that which is possible with any finite-round LOCC protocol.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
