We address the question of a quantum memory storage of quantum dynamics. In particular, we design an optimal protocol for $N\to 1$ probabilistic storage-and-retrieval of unitary channels on $d$-dimensional quantum systems. If we may access the unknown unitary gate only $N$-times, the optimal success probability of perfect retrieval of its single use is $N/(N-1+d^2)$. The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.
We investigate robustness of probabilistic storage and retrieval device optimized for phase gates to noise. We use noisy input composed of convex combination of unitary channel with either depolarizing or dephasing channel. We find out that the resistance to dephasing noise is higher than to depolarization. Interestingly, for the depolarisation the retrieval reduces the degree of noise. We also examine the possible realizations showing that their performance is different when the noise is present.
We proposed a general transformation in probabilistic teleportation, which is based on different entanglement matching coefficients $K$ corresponding to different unitary evolution which provides one with more flexible evolution method experimentally. Through analysis based on the Bell basis and generalized Bell basis measurement for two probabilistic teleportation, we suggested a general probability of successful teleportation, which is not only determined by the entanglement degree of transmission channels and measurement methods, but also related to the unitary transformation in the telepor…
We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A = {{| {Ψ_i} > ,| {\bar Ψ_i} >}}({i = 1,2})$ if and only if $| {Ψ_1} > ,| {Ψ_2} > ,| {\bar Ψ_1} > ,| {\bar Ψ_2} >$ are linearly independent. We also derive the best transformation efficiencies.
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small amount of entanglement; (ii) that a known, noisy, non-local unitary operation as well as an unknown, noisy, local unitary operation can be purified; (iii) how to perform the tomography of arbitrary, unknown, non-local operations; (iv) that a set of local unitary operations as well as a set of non-local unitary operations can be stored and compressed; (v) how t…
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the case of probabilistic simulation and allowing for arbitrary local operations, we provide necessary and sufficient conditions for the simulation to be possible. Deterministic and probabilistic interconversion under certain kinds of local operations are used to define equivalence relations between gates. In the probabilistic, bipartite case this induces a finite …
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that fin…
Imaginary time evolution is a powerful tool applied in quantum physics, while existing classical algorithms for simulating imaginary time evolution suffer high computational complexity as the quantum systems become larger and more complex. In this work, we propose a probabilistic algorithm for implementing imaginary time evolution based on non-unitary quantum circuit. We demonstrate the feasibility of this method by solving the ground state energy of several quantum many-body systems, including H2, LiH molecules and the quantum Ising chain. Moreover, we perform experiments on superconducting a…
Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [PRL 122, 170502 (2019)]. Here we study improvements due to a priori knowledge about the unitary transformation to be stored. In particular, we study $N \rightarrow 1$ PSR of qubit phase gates, i.e. qubit rotations a round $Z$ axis with an unknown angle, and show that if we access the gate only $N$-times, the optimal probability of perfect retrieving of its single use is $N/(N+1)$. We propose a quantum circ…
We study the entanglement structure, i.e., the structure of quantum composite system from operational aspects. The structure is not uniquely determined in General Probabilistic Theories (GPTs) even if we impose reasonable postulate about local systems. In this paper, we investigate the possibility that the standard entanglement structure can be determined uniquely by repeatability of measurement processing and its saturated situation called self-duality. Surprisingly, self-duality cannot determine the standard entanglement structure even if we additionally impose local unitary symmetry assumpt…
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be gen…
We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results by considering the automata versions of these models.
The most basic scenario of quantum control involves the organized manipulation of pure dynamical states of the system by means of unitary transformations. Recently, Vilela Mendes and Mank'o have shown that the conditions for controllability on the state space become less restrictive if unitary control operations may be supplemented by projective measurement. The present work builds on this idea, introducing the additional element of indirect measurement to achieve a kind of remote control. The target system that is to be remotely controlled is first entangled with another identical system, cal…
We study work extraction from the Dicke model achieved using simple unitary cyclic transformations keeping into account both a non optimal unitary protocol, and the energetic cost of creating the initial state. By analyzing the role of entanglement, we find that highly entangled states can be inefficient for energy storage when considering the energetic cost of creating the state. Such surprising result holds notwithstanding the fact that the criticality of the model at hand can sensibly improve the extraction of work. While showing the advantages of using a many-body system for work extractio…
We study the ability of a quantum channel to generate quantum coherence when it applies to incoherent states. Based on probabilistic averages, we define a measure of such coherence generating power (CGP) for a generic quantum channel, based on the average coherence generated by the quantum channel acting on a uniform ensemble of incoherent states. Explicit analytical formula of the CGP for any unitary channels are presented in terms of subentropy. An upper bound for CGP of unital quantum channels has been also derived. Detailed examples are investigated.
In quantum mechanics, outcomes of measurements on a state have a probabilistic interpretation while the evolution of the state is treated deterministically. Here we show that one can also treat the evolution as being probabilistic in nature and one can measure `which unitary' happened. Likewise, one can give an information-theoretic interpretation to evolutions by defining the entropy of a completely positive map. This entropy gives the rate at which the informational content of the evolution can be compressed. One cannot compress this information and still have the evolution act on an unknown…
Hilbert space operators may be mapped onto a space of ordinary functions (operator symbols) equipped with an associative (but noncommutative) star-product. A unified framework for such maps is reviewed. Because of its clear probabilistic interpretation, a particular class of operator symbols (tomograms) is proposed as a framework for quantum information problems. Qudit states are identified with maps of the unitary group into the simplex. The image of the unitary group on the simplex provides a geometrical characterization of the nature of the quantum states. Generalized measurements, typical …
We study when a non--local unitary operation acting on two $d$--level systems can probabilistically simulate another one when arbitrary local operations and classical communication are allowed. We provide necessary and sufficient conditions for the simulation to be possible. Probabilistic interconvertability is used to define an equivalence relation between gates. We show that this relation induces a finite number of classes, that we identify. In the case of two qubits, two classes of non--local operations exist. We choose the CNOT and SWAP as representatives of these classes. We show how the …
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of classical bit strings from which the original pure states are approximately reconstructible. We derive asymptotically tight bounds on the minimum bit length required for probabilistic encodings with which one can approximately reconstruct the original pure state as an ensemble of the quantum states encoded in classical strings. We also show that such a probabil…
We present a scheme of probabilistic dense coding via a quantum channel of non-maximally entangled three-particle state. The quantum dense coding will be succeeded with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. Furthermore, the average information transmitted in this scheme is calculated.
We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is universal for separate state and entanglement. We also provide the realization in the condition given $M$ initial copies for each state.
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics, where two-qubit gates can only be achieved probabilistically, our method significantly reduces the amount of components and increases success probability of a two-qubit gate. The experimental implementation of our technique presented in this paper for a controlled single-qubit unitary gate demonstrates that only one tunable controlled-phase gate is needed inst…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state preparation algorithm. To discuss the gate complexity in these algorithms, we decompose the diagonal unitary operators included in the phase estimation algorithms into the basic gates. Thus, we associate the state preparation problem with the decomposition problem of the diagonal unitary operators. We analyse the fidelities in the two algorithms and discuss the s…
We show how quantum dynamics (a unitary transformation) can be captured in the state of a quantum system, in such a way that the system can be used to perform, at a later time, the stored transformation almost perfectly on some other quantum system. Thus programmable quantum gates for quantum information processing are feasible if some small degree of imperfection is allowed. We discuss the possibility of using this fact for securely computing a secret function on a public quantum computer. Finally, our scheme for storage of operations also allows for a new form of quantum remote control.
Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in classical approaches, needs special designing. Here, by application of Grover's algorithm, we extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing. This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
The quantification of the quantumness of a quantum ensemble has theoretical and practical significance in quantum information theory. We propose herein a class of measures of the quantumness of quantum ensembles using the unitary similarity invariant norms of the commutators of the constituent density operators of an ensemble. Rigorous proof shows that they share desirable properties for a measure of quantumness, such as positivity, unitary invariance, concavity under probabilistic union, convexity under state decomposition, decreasing under coarse graining, and increasing under fine graining.…
Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is probabilistic, with postselection of the measurement result. The output is determined by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance t…
Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance. Exploiting this observation, we propose representation matching, a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including remote execution of unitary gate arrays, permutation gates and unitary conjugation, as well as the storage and retrieval of unitary gates.
Quantum information storage (QIS) is a physical process to write quantum states into a quantum memory (QM). We observe that in some general cases the quantum state can be retrieved up to a unitary transformation depicted by the non-Abelian Berry's geometric phase factor (holonomy). The QIS of photon with this geometric character can be implemented with the symmetric collective excitations of a $Λ$-atom ensemble, which is adiabatically controlled by a classical light with a small detuning $δ$. The cyclic change of the controlled Rabi frequency $Ω(t)$ with period $T=\frac{2nπ}δ$ accumulates addi…
Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of simulations. This means that the time when simulation terminates for a given computation is probabilistic, and this simulation may even never end. We introduce (section 3) a measurement-based model with non probabilistic termination, which permits, unlike existing models, to predict the time of termination. This new scheme is a modification of Nielsen's. After …
We investigate quantum information masking for arbitrary dimensional quantum states. We show that mutually orthogonal quantum states can always be served for deterministic masking of quantum information. We further construct a probabilistic masking machine for linearly independent states. It is shown that a set of d dimensional states, $\{ |a_1 \rangle_A, |t a_2 \rangle_A, \dots, |a_n \rangle_A \}$, $n \leq d$, can be probabilistically masked by a general unitary-reduction operation if they are linearly independent. The maximal successful probability of probabilistic masking is analyzed and de…
We study the role of coherence in closed and open quantum batteries. We obtain upper bounds to the work performed or energy exchanged by both closed and open quantum batteries in terms of coherence. Specifically, we show that the energy storage can be bounded by the Hilbert-Schmidt coherence of the density matrix in the spectral basis of the unitary operator that encodes the evolution of the battery. We also show that an analogous bound can be obtained in terms of the battery's Hamiltonian coherence in the basis of the unitary operator by evaluating their commutator. We apply these bounds to a…
We propose a probabilistic quantum cloning scheme using Greenberger-Horne-Zeilinger states, Bell basis measurements, single-qubit unitary operations and generalized measurements, all of which are within the reach of current technology. Compared to another possible scheme via Tele-CNOT gate [D. Gottesman and I. L. Chuang, Nature 402, 390 (1999)], the present scheme may be used in experiment to clone the states of one particle to those of two different particles with higher probability and less GHZ resources.
We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of the dimension N with a certain probability. If the operation is unitary, the probability is in general 1/N^2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of t…
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $\$=\left\{\left| Ψ_1\right> ,\left| Ψ_2\right> ,... ,\left| Ψ_n\right> \right\} $ can be probabilistically cloned if and only if $% \left| Ψ_1\right>$, $\left| Ψ_2\right>$, $... ,$ and $\left| Ψ_n\right>$ are linearly-independent. We derive the best possible cloning efficiencies. Probabilistic cloning has close connection with the pro…
Teleporation with partially entangled quantum channel cannot achieve unit fidelity and unit probability. We show that the conditions for faithful teleportation of a pure state or a mixed state can be described by the same general relation $ρ_{q}ρ_{m} = pI$, where $ρ_{q}$ is the reduced density matrix of the quantum channel, $ρ_{m}$ is the reduced density matrix of the measurement basis, and $p$ is the probability of faithful teleportaion. We investigate the invariance of faithful teleportation conditions under unitary transformation. These results not only bring new insights to the probabilist…
To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider a setting of networks where quantum communication between nodes is restricted to sending just a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the gr…
Quantum repeaters hold the promise to prevent the photon losses in communication channels. Most recently, the serious efforts have been applied to achieve scalable distribution of entanglement over long distances. However, the probabilistic nature of entanglement generation and realistic quantum memory storage times make the implementation of quantum repeaters an outstanding experimental challenge. We propose a quantum repeater protocol based on the deterministic storage of a single photon in atomic ensembles confined in distant high-finesse cavities and show that this system is capable of dis…
We address the problem of quantum reading of optical memories, namely the retrieving of classical information stored in the optical properties of a media with minimum energy. We present optimal strategies for ambiguous and unambiguous quantum reading of unitary optical memories, namely when one's task is to minimize the probability of errors in the retrieved information and when perfect retrieving of information is achieved probabilistically, respectively. A comparison of the optimal strategy with coherent probes and homodyne detection shows that the former saves orders of magnitude of energy …
Quantum experiments yield random data. We show that the most efficient way to store this empirical information by a finite number of bits is by means of the vector of square roots of observed relative frequencies. This vector has the unique property that its dispersion becomes invariant of the underlying probabilities, and therefore invariant of the physical parameters. This also extends to the complex square roots, and it remains true under a unitary transformation. This reveals quantum theory as a theory for making predictions which are as accurate as the input information, without any stati…
The task of changing the overlap between two quantum states can not be performed by making use of a unitary evolution only. However, by means of a unitary-reduction process it can be probabilistically modified. Here we study in detail the problem of mapping two known pure states onto other two states in such a way that the final inner product between the outcome states is different from the inner product of the initial states. In this way we design an optimal non-orthogonal quantum state preparation scheme by starting from an orthonormal basis. In this scheme the absolute value of the inner pr…
A non-standard teleportation scheme is proposed, wherein probabilistic teleportation is achieved in conventionally non-teleporting channels. We make use of entanglement monogamy to incorporate an unknown state in a multipartite entangled channel, such that the receiver partially gets disentangled from the network. Subsequently, the sender performs local measurement based teleportation protocol in an appropriate measurement basis, which results with the receiver in the possession of an unknown state, connected by local unitary transformation with the state to be teleported. This procedure succe…
We present a systematic analysis how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition we show that the same strategy can be utilized for a probabilistic implementation of non-unitary transformations on qubits. In addtion, we show that an arbitrary SU(2) transformations of…
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
Experimental implementation of a quantum algorithm requires unitary operator decomposition. Here we treat the unitary operator decomposition as an optimization problem and use Genetic Algorithm, a global optimization method inspired by nature's evolutionary process for operator decomposition. As an application, we apply this to NMR Quantum Information Processing and find a probabilistic way of doing universal quantum computation using global hard pulses. We also demonstrate efficient creation of singlet state (as a special case of Bell state) directly from thermal equilibrium using an optimum …
We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical information in atomic spins. In addition to the configurability, the protocol also offers favourable scaling with an increasing number of modes where N memories can be configured to implement an arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memori…
