A quantum cellular network with a qubit and ancilla bits in each cell is proposed. The whole circuit works only with the help of external optical pulse sequences. In the operation, some of the ancilla bits are activated, and autonomous single- and two-qubit operations are made. In the sleep mode of a cell, the decoherence of the qubit is negligibly small. Since only two cells at most are active at once, the coherence can be maintained for a sufficiently long time for practical purposes. A device structure using a quantum dot array with possible operation and measurement schemes is also proposed.
This paper investigates the synthesis of quantum networks built to realize ternary switching circuits in the absence of ancilla bits. The results we established are twofold. The first shows that ternary Swap, ternary Not and ternary Toffoli gates are universal for the realization of arbitrary $n\times n$ ternary quantum switching networks without ancilla bits. The second result proves that all $n\times n$ quantum ternary networks can be generated by Not, Controlled-Not, Multiply-Two, and Toffoli gates. Our approach is constructive. key words: ternary quantum logic synthesis, quantum circuit op…
Reversible logic has attracted much research interest over the last few decades, especially due to its application in quantum computing. In the construction of reversible gates from basic gates, ancilla bits are commonly used to remove restrictions on the type of gates that a certain set of basic gates generates. With unlimited ancilla bits, many gates (such as Toffoli and Fredkin) become universal reversible gates. However, ancilla bits can be expensive to implement, thus making the problem of minimizing necessary ancilla bits a practical topic. This thesis explores the problem of reversible …
We propose an approach for single spin measurement. Our method uses techniques from the theory of quantum cellular automata to correlate a large amount of ancillary spins to the one to be measured. It has the distinct advantage of being efficient, and to a certain extent fault-tolerant. Under ideal conditions, it requires the application of only order of cube root of N steps (each requiring a constant number of rf pulses) to create a system of N correlated spins. It is also fairly robust against pulse errors, imperfect initial polarization of the ancilla spin system, and does not rely on entan…
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the elements of Grover's algorithm - the inversion of amplitude of searched states and unitary transform of inversion about the average. The inversion of searched states amplitudes can be performed by quantum Toffoli gate.
We make use of local operations with two ancilla bits to deterministically distinguish all the four Bell states, without affecting the quantum channel containing these Bell states.
We study the computational power of shallow quantum circuits with $O(\log n)$ initialized and $n^{O(1)}$ uninitialized ancillary qubits, where $n$ is the input length and the initial state of the uninitialized ancillary qubits is arbitrary. First, we show that such a circuit can compute any symmetric function on $n$ bits that is classically computable in polynomial time. Then, we regard such a circuit as an oracle and show that a polynomial-time classical algorithm with the oracle can estimate the elements of any unitary matrix corresponding to a constant-depth quantum circuit on $n$ qubits. S…
A scheme is proposed for protecting quantum states from both independent decoherence and cooperative decoherence. The scheme operates by pairing each qubit (two-state quantum system) with an ancilla qubit and by encoding the states of the qubits into the corresponding coherence-preserving states of the qubit-pairs. In this scheme, the amplitude damping (loss of energy) is prevented as well as the phase damping (dephasing) by a strategy called the free-Hamiltonian-elimination We further extend the scheme to include quantum gate operations and show that loss and decoherence during the gate opera…
Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum …
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a general method of ancilla removal. Further, we show how to define a group of QCA that is well-defined without needing to use families, by showing how to construct a coherent family containing an arbitrary finite QCA; the coherent family consists of QCA on progressively finer systems of qudits where any two members are related by a shallow quantum circuit. Thi…
Based on electron spins in semiconductor quantum dots as qubits, a new quantum controlled-NOT(CNOT) gate is constructed in solid nanostructure without resorting to spin-spin interactions. Single electron tunneling technology and coherent quantum-dot cellular automata architecture are used to generate an ancillary charge entangled state. Using the ancillary charge entangled state as an intermediate state, we obtain a spin entangled state and design a CNOT gate by using only single spin rotations.
The Hidden Weighted Bit function plays an important role in the study of classical models of computation. A common belief is that this function is exponentially hard for the implementation by reversible ancilla-free circuits, even though introducing a small number of ancillae allows a very efficient implementation. In this paper, we refute the exponential hardness conjecture by developing a polynomial-size reversible ancilla-free circuit computing the Hidden Weighted Bit function. Our circuit has size $O(n^{6.42})$, where $n$ is the number of input bits. We also show that the Hidden Weighted B…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous approaches for efficient estimation of average gate fidelity replaced Haar random unitaries in the naive estimation algorithm by approximate unitary 2-designs, and sampled them uniformly and independently. In contrast, in our first algorithm we sample the unitaries of the approximate unitary 2-design uniformly using a limited independence pseudorandom generator…
A quantum mechanical system S is indirectly controlled when the control affects an ancillary system A and the evolution of S is modified through the interaction with A only. A study of indirect controllability gives a description of the set of states that can be obtained for S with this scheme. In this paper, we study the indirect controllability of quantum systems in the finite dimensional case. After discussing the relevant definitions, we give a general necessary condition for controllability in Lie algebraic terms. We present a detailed treatment of the case where both systems, S and A, ar…
Electron and nuclear spins associated with point defects in insulators are promising systems for solid state quantum technology. While the electron spin usually is used for readout and addressing, nuclear spins are exquisite quantum bits and memory systems. With these systems single-shot readout of nearby nuclear spins as well as entanglement aided by the electron spin has been shown. While the electron spin in this example is essential for readout it usually limits nuclear spin coherence. This has set of the quest for defects with spin-free ground states. Here, we isolate a hitherto unidentif…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more complex multilevel states -- qudits. Recently, significant attention is paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints, that uses ququints' space as the space of two qubits with a joi…
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum channel for sending classical and quantum information simultaneously. Our method incorporates several resources for quantum redundancy: fresh ancilla qubits, entangled bits, and gauge qubits. The use of these diverse resources gives our technique the benefits of both active and passive quantum error correction. We can encode a classical-quantum bit stream wi…
A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically on bit configurations. The genuinely probabilistic character of quantum physics is realized by probabilistic initial conditions. In turn, the probabilistic automaton is equivalent to the classical statistical system of a generalized Ising model. For a description of the probabilistic information at any given time quantum concepts as wave functions and non-co…
In order to prepare for the introduction of dynamical many-body and, eventually, field theoretical models, we show here that quantum mechanical exchange interactions in a three-spin chain can emerge from the deterministic dynamics of three classical Ising spins. States of the latter form an ontological basis, which will be discussed with reference to the ontology proposed in the Cellular Automaton Interpretation of Quantum Mechanics by 't Hooft. Our result illustrates a new Baker-Campbell-Hausdorff formula with terminating series expansion.
We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are available for free. Our classification can be seen as the reversible-computing analogue of Post's lattice, a central result in mathematical logic from the 1940s. It is a step toward the ambitious goal of classifying all possible quantum gate sets acting on qubits. Our theorem implies a linear-time algorithm (which we have implemented), that takes as input the truth tables of reversible gates G and…
We study matrix product unitary operators (MPUs) for fermionic one-dimensional (1D) chains. In stark contrast with the case of 1D qudit systems, we show that (i) fermionic MPUs do not necessarily feature a strict causal cone and (ii) not all fermionic Quantum Cellular Automata (QCA) can be represented as fermionic MPUs. We then introduce a natural generalization of the latter, obtained by allowing for an additional operator acting on their auxiliary space. We characterize a family of such generalized MPUs that are locality-preserving, and show that, up to appending inert ancillary fermionic de…
Quantum-dot cellular automata (QCA) may provide low-power, general-purpose computing in the post-CMOS era. A molecular implementation of QCA features nanometer-scale devices and may support THz switching speeds at room-temperature. Here, we explore the ability of molecular QCA circuits to tolerate unwanted applied electric fields, which may come from a variety of sources. One likely source of strong unwanted electric fields may be electrodes recently proposed for the write-in of classical bits to molecular QCA input circuits. Previous models have shown that the input circuits are sensitive to …
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under "Goldilocks rules" that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy flu…
Quantum-dot cellular automata (QCA) is a paradigm for low-power, general-purpose, classical computing designed to overcome the challenges facing CMOS in the extreme limits of scaling. A molecular implementation of QCA offers nanometer-scale devices with device densities and operating speeds which may surpass CMOS device densities and speeds by several orders of magnitude, all at room temperature. Here, a proposal for electric field bit write-in to molecular QCA circuits is extended to synchronous QCA circuits clocked using an applied electric field, \(\vec{E}\). Input electrodes, which may be …
Improving coherence times of quantum bits is a fundamental challenge in the field of quantum computing. With long-lived qubits it becomes, however, inefficient to wait until the qubits have relaxed to their ground state after completion of an experiment. Moreover, for error-correction schemes it is import to rapidly re-initialize ancilla parity-check qubits. We present a simple pulsed qubit reset protocol based on a two-pulse sequence. A first pulse transfers the excited state population to a higher excited qubit state and a second pulse into a lossy environment provided by a low-Q transmissio…
Quantum bits or qubits naturally decohere by becoming entangled with uncontrollable environments. Dynamical decoupling is thereby required to disentangle qubits from an environment by periodically reversing the qubit bases, but this causes rotation error to accumulate. Whereas a conventional qubit is rotated within the SU(2) two-level system, a geometric qubit defined in the degenerate subspace of a V-shaped SU(3) three-level system is geometrically rotated via the third ancillary level to acquire a geometric phase. We here demonstrate that, simply by introducing detuning, the dynamical decoup…
Quantum protocols require access to large-scale entangled quantum states, due to the requirement of channel capacity. As a promising candidate, the high-dimensional orbital angular momentum (OAM) entangled states have been implemented, but only one of four OAM Bell states in each individual subspace can be distinguished. Here we demonstrate the first realization of complete OAM Bell-state measurement (OAM-BSM) in an individual subspace, by seeking the suitable unitary matrix performable using only linear optics and breaking the degeneracy of four OAM Bell states in ancillary polarization dimen…
We discuss the implementation of an iterative quantum phase estimation algorithm, with a single ancillary qubit. We suggest using this algorithm as a benchmark for multi-qubit implementations. Furthermore we describe in detail the smallest possible realization, using only two qubits, and exemplify with a superconducting circuit. We discuss the robustness of the algorithm in the presence of gate errors, and show that 7 bits of precision is obtainable, even with very limited gate accuracies.
We propose a rotationally-invariant quantum key distribution scheme that uses a pair of orthogonal qubit trines, realized as mixed states of three physical qubits. The measurement outcomes do not depend on how Alice and Bob choose their individual reference frames. The efficient key generation by two-way communication produces two independent raw keys, a bit key and a trit key. For a noiseless channel, Alice and Bob get a total of 0.573 key bits per trine state sent (98% of the Shannon limit). This exceeds by a considerable amount the yield of standard trine schemes, which ideally attain half …
In this note, we characterize the form of an invertible quantum operation, i.e., a completely positive trace preserving linear transformation (a CPTP map) whose inverse is also a CPTP map. The precise form of such maps becomes important in contexts such as self-testing and encryption. We show that these maps correspond to applying a unitary transformation to the state along with an ancilla initialized to a fixed state, which may be mixed. The characterization of invertible quantum operations implies that one-way schemes for encrypting quantum states using a classical key may be slightly more g…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computational model …
In this paper we propose two schemes for teleportation of a sub-class of tripartite states, the first one with the four-qubit cluster state and the second one with two Bell pairs as entanglement channels. A four-qubit joint measurement in the first case and two Bell measurements in the second are performed by the sender. Appropriate unitary operations on the qubits at the receiver's end along with an ancilla qubit result in the perfect teleportation of the tripartite state. Analysis of the quantum circuits employed in these schemes reveal that in our technique the desired quantum tasks are ach…
Quantum-dot cellular automata (QCA) is a low-power, non-von-Neumann, general-purpose paradigm for classical computing using transistor-free logic. An elementary QCA device called a "cell" is made from a system of coupled quantum dots with a few mobile charges. The cell's charge configuration encodes a bit, and quantum charge tunneling within a cell enables device switching. Arrays of cells networked locally via the electrostatic field form QCA circuits, which mix logic, memory and interconnect. A molecular QCA implementation promises ultra-high device densities, high switching speeds, and room…
Mapping functions on bits to Hamiltonians acting on qubits has many applications in quantum computing. In particular, Hamiltonians representing Boolean functions are required for applications of quantum annealing or the quantum approximate optimization algorithm to combinatorial optimization problems. We show how such functions are naturally represented by Hamiltonians given as sums of Pauli $Z$ operators (Ising spin operators) with the terms of the sum corresponding to the function's Fourier expansion. For many classes of functions which are given by a compact description, such as a Boolean f…
We compute on all quantum states several measures that characterise asymptotic quantum coherence manipulation under restricted classes of operations. We focus on the distillable coherence, i.e. the maximum rate of production of approximate pure bits of coherence starting from independent copies of an input state $ρ$, and on the coherence cost, i.e. the minimum rate of consumption of pure coherence bits that is needed to generate many copies of $ρ$ with vanishing error. We obtain the first closed-form expression for the distillable coherence under strictly incoherent operations (SIO), proving t…
We study locality preserving automorphisms of operator algebras on $D$-dimensional uniform lattices of prime $p$-dimensional qudits (QCA), specializing in those that are translation invariant (TI) and map every prime $p$-dimensional Pauli matrix to a tensor product of Pauli matrices (Clifford). We associate antihermitian forms of unit determinant over Laurent polynomial rings to TI Clifford QCA with lattice boundaries, and prove that the form determines the QCA up to Clifford circuits and shifts (trivial). It follows that every 2D TI Clifford QCA is trivial since the antihermitian form in this…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla--a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qub…
Quantum-Adaptive KS($φ$): A Parameterized Three-Qubit Gate Family Embedding Toffoli with Measurement-Free Phase Kickback and Intrinsic Error Non-Amplification
