Related papers: Creating Boolean Functions for the Five-EPR-Pair, …
Einstein-Podolsky-Rosen (EPR) steering and Bell nonlocality illustrate two different kinds of correlations predicted by quantum mechanics. They not only motivate the exploration of the foundation of quantum mechanics, but also serve as…
The known quantum error-correcting codes are typically built on approximative open-quantum-system models such as Born--Markov master equations. However, it is an open question how such codes perform in actual physical systems that, to some…
Quantum error-correcting codes are many-body entangled states that are prepared and measured using complex sequences of entangling operations. Each element of such an entangling sequence introduces noise to delicate quantum information…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum…
Entanglement purification protocols, designed to improve the fidelity of Bell states over quantum networks for inter-node communications, have attracted significant attention over the last few decades. These protocols have great potential…
Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent developments in synthesis algorithms, Boolean functional…
The quantum query models is one of the most important models in quantum computing. Several well-known quantum algorithms are captured by this model, including the Deutsch-Jozsa algorithm, the Simon algorithm, the Grover algorithm and…
Quantum computation and communication rely on the ability to manipulate quantum states robustly and with high fidelity. Thus, some form of error correction is needed to protect fragile quantum superposition states from corruption by…
Quantum networks are expected to enhance distributed quantum computing and quantum communication over long distances while providing security dependent upon physical effects rather than mathematical assumptions. Through simulation, we show…
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of…
We study minimum-error identification of an unknown single-bit Boolean function given black-box (oracle) access with one allowed query. Rather than stopping at an abstract optimal measurement, we give a fully constructive solution: an…
It is important to protect quantum information against decoherence and operational errors, and quantum error-correcting (QEC) codes are the keys to solving this problem. Of course, just the existence of codes is not efficient. It is…
Quantum error-correction codes would protect an arbitrary state of a multi-qubit register against decoherence-induced errors, but their implementation is an outstanding challenge for the development of large-scale quantum computers. A first…
The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the…
Classification of different forms of quantum entanglement is an active area of research, central to development of effective quantum computers, and similar to classification of error-correction codes, where code duality is broadened to…
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box.…
Quantum error correction protects the quantum state against noise and decoherence in quantum communication and quantum computation, which enables one to perform fault-torrent quantum information processing. We experimentally demonstrate a…