We investigate the problem of Bayesian updating of a probability distribution encoded in the quantum state of n qubits. The updating procedure takes the form of a quantum algorithm that prepares the quantum register in the state representing the posterior distribution. Depending on how the prior distribution is given, we describe two implementations, one probabilistic and one deterministic, of such an algorithm in the standard model of a quantum computer.
In order to eliminate disturbing effects of decoherence, encoding of quantum information in decoherence-free subspaces has been suggested. We analyze the benefits of this concept for a quantum register that is realized in a spin chain in contact with a common bosonic bath. Within a dissipation-less model we provide explicit analytical results for the average fidelity of plain and encoded quantum registers. For the investigation of dissipative spin-boson couplings we employ a master equation of Bloch-Redfield type.
Quantum computing promises to provide exponential speed-ups to certain classes of problems. In many such algorithms, a classical vector $\mathbf{b}$ is encoded in the amplitudes of a quantum state $\left |b \right >$. However, efficiently preparing $\left |b \right >$ is known to be a difficult problem because an arbitrary state of $Q$ qubits generally requires approximately $2^Q$ entangling gates, which results in significant decoherence on today's Noisy Intermediate Scale Quantum (NISQ) computers. We present a deterministic (nonvariational) algorithm that allows one to flexibly reduce the qu…
I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each $N$ state quantum particle is encoded as five $N$ state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is shown to be optimal for higher spin systems. I also report a simple algorithm for encoding. The importance of multiplicative group character in constructing QECCs will be addressed.
We present a paradigm for constructing approximate quantum circuits from reversible classical circuits that operate on many possible encodings of an input and send almost all encodings of that input to an encoding of the correct output. We introduce oblivious carry runways, which use piecewise addition circuits to perform approximate encoded additions and reduce the asymptotic depth of addition to $O(\lg \lg n)$. We show that the coset representation of modular integers (Zalka 2006) is an approximate encoded modular addition, and that it can be used in combination with oblivious carry runways.…
A model for a quantum register dissipatively coupled with a bosonic thermal bath is studied. The register consists of $N$ qubits (i.e. spin ${1/2}$ degrees of freedom), the bath is described by $N_b$ bosonic modes. The register-bath coupling is chosen in such a way that the total number of excitations is conserved. The Hilbert space splits allowing the study of the dynamics separately in each sector. Assuming that the coupling with the bath is the same for all qubits, the excitation sectors have a further decomposition according the irreducible representations of the $su(2)$ spin algebra. The …
This study deals with the further development of nuclear spin model of scalable quantum register, which presents the one-dimensional chain of the magnetic atoms with nuclear spins 1/2, substituting the basic atoms in the plate of nuclear spin-free easy-axis 3D antiferromagnet. The decoherence rates of one qubit state and entanglement state of two removed qubits and longitudinal relaxation rates are caused by the interaction of nuclear spins-qubits with virtual spin waves in antiferromagnet ground state were calculated. It was considered also one qubit adiabatic decoherence, is caused by the in…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning algorithms applied to classical data. The protocol combines partial CNOT gate rotations with probabilistic projection onto the desired state. The number of additional ancilla qubits used during the implementation of the protocol, as well as the number of quantum gates, scale linearly with the number of qubits in the processing register and hence logarithmic…
Hypothesis elimination is a special case of Bayesian updating, where each piece of new data rules out a set of prior hypotheses. We describe how to use Grover's algorithm to perform hypothesis elimination for a class of probability distributions encoded on a register of qubits, and establish a lower bound on the required computational 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…
Solid-state quantum registers are exceptional for storing quantum information at room temperature with long coherence time. Nevertheless, practical applications toward quantum supremacy require even longer coherence time to allow for more complex algorithms. In this work we propose a quantum register that lies in a decoherence-free subspace to be implemented with color centers in diamond. The quantum information is encoded in two logical states composed of two nearby nuclear spins, while an electron spin is used as ancilla for initialization and control. Moreover, by tuning an off-axis magneti…
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as low-entanglement states of the quantum register. These states can be efficiently created in a quantum computer, but they are also efficiently stored, manipulated and probed using Matrix-Product States techniques. Inspired by this idea, we present eight quantum-inspired numerical analysis algorithms, that include Fourier sampling, interpolation, differentiation and integ…
Quantum registers of nuclear spins coupled to electron spins of individual solid-state defects are a promising platform for quantum information processing. Pioneering experiments selected defects with favourably located nuclear spins having particularly strong hyperfine couplings. For progress towards large-scale applications, larger and deterministically available nuclear registers are highly desirable. Here we realize universal control over multi-qubit spin registers by harnessing abundant weakly coupled nuclear spins. We use the electron spin of a nitrogen-vacancy centre in diamond to selec…
We propose and analyze a novel approach to quantum information processing, in which multiple qubits can be encoded and manipulated using electronic and nuclear degrees of freedom associated with individual alkaline-earth atoms trapped in an optical lattice. Specifically, we describe how the qubits within each register can be individually manipulated and measured with sub-wavelength optical resolution. We also show how such few-qubit registers can be coupled to each other in optical superlattices via conditional tunneling to form a scalable quantum network. Finally, potential applications to qu…
We investigate quantum repeater protocols that rely on three-qubit repetition codes using nitrogen-vacancy (NV) centers in diamond as quantum memories. NV centers offer a two-qubit register, corresponding to their electron and nuclear spins, which makes it possible to perform deterministic two-qubit operations within one NV center. For quantum repeater applications, we, however, need to do joint operations on two separate NV centers. Here, we study two NV-center based repeater structures that enable such deterministic joint operations. One structure offers less consumption of classical communi…
The DisCoCat model of natural language meaning assigns meaning to a sentence given: (i) the meanings of its words, and, (ii) its grammatical structure. The recently introduced DisCoCirc model extends this to text consisting of multiple sentences. While in DisCoCat all meanings are fixed, in DisCoCirc each sentence updates meanings of words. In this paper we explore different update mechanisms for DisCoCirc, in the case where meaning is encoded in density matrices---which come with several advantages as compared to vectors. Our starting point are two non-commutative update mechanisms, borrowing…
We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations are supplemented by controlled bit-flip and Hadamard operations. We consider synchronous updating schemes in which each qubit is updated at each step based on stored values of the qubits from the previous step. We investigate the periodic or quasiperiodic behavior of quantum networks, and we analyze the propagation of single site perturbations through the quantum networks with input degree one. A no…
We examine the question of whether quantum mechanics places limitations on the ability of small quantum devices to learn. We specifically examine the question in the context of Bayesian inference, wherein the prior and posterior distributions are encoded in the quantum state vector. We conclude based on lower bounds from Grover's search that an efficient blackbox method for updating the distribution is impossible. We then address this by providing a new adaptive form of approximate quantum Bayesian inference that is polynomially faster than its classical analogue and tractable if the quantum s…
The ability to selectively measure, initialize, and reuse qubits during a quantum circuit enables a mapping of the spatial structure of certain tensor-network states onto the dynamics of quantum circuits, thereby achieving dramatic resource savings when using a quantum computer to simulate many-body systems with limited entanglement. We experimentally demonstrate a significant benefit of this approach to quantum simulation: In addition to all correlation functions, the entanglement structure of an infinite system -- specifically the half-chain entanglement spectrum -- is conveniently encoded w…
Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. We present novel strategies to enhance the amplification procedure by partitioning the states into classes, whose probabilities are increased at different levels before or during amplification. The partitioning process is based on the binomial distribution. If the classes to which the search target states belong are known in advance, the number of iterations in the Amplitude Amplification algorithm can be drastically …
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution. Quantum computation is a new computational paradigm which exploits quantum resources to speed up information processing tasks. Therefore, it is sensible to explore the potential enhancement in the performance of genetic algorithms by introducing quantum degrees of freedom. Along this line, a modular quantum genetic algorithm has recently been proposed, with individuals encoded in independent registers comprising exchangeable quantum subroutines [arXiv:2203.15039], which leads to different variants. Here, …
