Related papers: Quantum Synchronizing Words: Resetting and Prepari…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
We introduce a technique that allows one to connect any two arbitrary (pure or mixed) superposition states of an N-state quantum system. The proposed solution to this inverse quantum mechanical problem is analytical, exact, and very…
A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Cerny had found in 1964 a sequence of n-state complete DFA with…
In nature, instances of synchronisation abound across a diverse range of environments. In the quantum regime, however, synchronisation is typically observed by identifying an appropriate parameter regime in a specific system. In this work…
While the preparation of a general quantum state is challenging, realistic problem instances, such as those encountered in quantum chemistry and quantum machine learning-typically exhibit hierarchical amplitude structures, consisting of a…
Faithfully transferring the quantum state is essential for quantum information processing. Here we demonstrate a fast (in 84 ns) and high-fidelity (99.2%) transfer of arbitrary quantum states in a chain of four superconducting qubits with…
A multi-party protocol for distributed quantum clock synchronization has been claimed to provide universal limits on the clock accuracy, viz. that accuracy monotonically decreases with the number n of party members. But, this is only true…
The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the…
We use notions and techniques of Quantum Field Theory to formulate and investigate basic concepts and mechanisms of human communication. We start with attitudes which correspond to photons frequencies, then we introduce states-of-mind which…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
We present a polynomial-time quantum algorithm making a single query (in superposition) to a classical oracle, such that for every state $|\psi\rangle$ there exists a choice of oracle that makes the algorithm construct an exponentially…
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a…
Recurrent neural networks are a widely used class of neural architectures. They have, however, two shortcomings. First, they are often treated as black-box models and as such it is difficult to understand what exactly they learn as well as…
Ubiquitous in quantum computing is the step to encode data into a quantum state. This process is called quantum state preparation, and its complexity for non-structured data is exponential on the number of qubits. Several works address this…
Clock synchronization for nonfaulty processes in multiprocess networks is indispensable for a variety of technologies. A reliable system must be able to resynchronize the nonfaulty processes upon some components failing causing the…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
We consider the problem of reversing quantum dynamics, with the goal of preserving an initial state's quantum entanglement or classical correlation with a reference system. We exhibit an approximate reversal operation, adapted to the…
We introduce a notion of synchronization for higher-dimensional automata, based on coskeletons of cubical sets. Categorification transports this notion to the setting of categorical transition systems. We apply the results to study the…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
A procedure to enhance the quantum--classical correspondence even in situations far from the classical limit is proposed. It is based on controlling the quantum transport between classical regions using the capability to synthesize…