Related papers: A universal quantum rewinding protocol with an arb…
We present a benchmarking protocol for universal quantum computers, achieved through the simulation of random dynamical quantum maps. This protocol provides a holistic assessment of system-wide error rates, encapsulating both gate…
Distributing quantum states reliably among distant locations is a key challenge in the field of quantum networks. One-way quantum networks address this by using one-way communication and quantum error correction. Here, we analyze quantum…
Control protocol to drive finite dimensional quantum systems to an arbitrary target state using square pulses is proposed explicitly. It is a multi-cycle control process and in each cycle we apply square pulses to cause single or a few…
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number chains employed in the scheme. The system consists of $M$ uncoupled…
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising…
We present a protocol for quantum fingerprinting that is ready to be implemented with current technology and is robust to experimental errors. The basis of our scheme is an implementation of the signal states in terms of a coherent state in…
A protocol of quantum communication is proposed in terms of the multi-qubit quantum teleportation through cluster states (Phys. Rev. Lett. \textbf{86}, 910 (2001)). Extending the cluster state based quantum teleportation on the basic unit…
Resetting a system's state plays a fundamental role in physics, engineering, computer science, and many other fields. Here we focus on a method originally proposed in automata theory. The state of an automaton evolves according to a set of…
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a…
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…
We consider a generalized quantum teleportation protocol for an unknown qubit using non-maximally entangled state as a shared resource. Without recourse to local filtering or entanglement concentration, using standard Bell-state measurement…
This paper proposes a general quantum algorithm that can be applied to any classical computer program. Each computational step is written using reversible operators, but the operators remain classical in that the qubits take on values of…
The scheme of quantum teleportation, where Bob has multiple (N) output ports and obtains the teleported state by simply selecting one of the N ports, is thoroughly studied. We consider both deterministic version and probabilistic version of…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum operations among quantum…
Quantum repeaters with multiple quantum memories provide high throughput, low latency, and high fidelity quantum state (qubit) transfer over long distances. However, conventional quantum repeater protocols require full connections among the…
It has been shown (Arxiv: quant-ph/0507236) that a universal quantum computer could be powerful enough to solve efficiently the quantum search problem, and the reversible and unitary halting protocol based on the state-locking pulse field…
The way a new type of state called a hybrid state, which contains more than one degree of freedom, is used in many practical applications of quantum communication tasks with lesser amount of resources. Similarly, our aim is here to perform…
Coherently manipulating multipartite quantum correlations leads to remarkable advantages in quantum information processing. A fundamental question is whether such quantum advantages persist only by exploiting multipartite correlations, such…
Quantum teleportation enables the deterministic exchange of qubits via lossy channels. While it is commonly believed that unconditional teleportation requires a preshared entangled qubit pair, here we demonstrate a protocol that is in…
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions…