Related papers: Quantum ground-state computation with static gates

We consider an extended model of quantum computation where a scalable fault-tolerant quantum computer is coupled to one or more ancilla qubits that evolve according to a nonlinear Schr\"odinger equation. Following the approach of Abrams and…

Any single-qubit unitary operation or quantum gate can be considered a rotation. Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes, and up to three rotation steps. Here we show that, if the…

Quantum computers are inherently affected by noise. While in the long-term error correction codes will account for noise at the cost of increasing physical qubits, in the near-term the performance of any quantum algorithm should be tested…

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…

Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…

We study the statistical behaviour of reasoning probes in a stylized model of looped reasoning, given by Boolean circuits whose computational graph is a perfect $\nu$-ary tree ($\nu\ge 2$) and whose output is appended to the input and fed…

We propose a (theoretical ;-) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder. The Hamiltonian is a spatially local interaction among…

The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which…

Memcomputing logic gates generalize the traditional Boolean logic gates for operation in the reverse direction. According to the literature, this functionality enables the efficient solution of computationally-intensive problems including…

The concrete schemes to realize three types of basic quantum logical gates using linear quadripartite cluster states of optical continuous variables are proposed. The influences of noises and finite squeezing on the computation precision…

We show how "single" quantum dots, each hosting a singlet-triplet qubit, can be placed in arrays to build a spin quantum cellular automaton. A fast ($\sim 10$ ns) deterministic coherent singlet-triplet filtering, as opposed to current…

The processing unit of a solid-state quantum computer consists in an array of coupled qubits, each locally driven with on-chip microwave lines that route carefully-engineered control signals to the qubits in order to perform logical…

Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gate sequence (with speedup over classical cost…

We present a continuous-time, neural-network-based approach to optimal control in quantum systems, with a focus on pulse engineering for quantum gates. Leveraging the framework of neural ordinary differential equations, we construct control…

A variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean gates that depend on at most one input. The bias is…

By using the memristor's memory to both store a bit and perform an operation with a second input bit, simple Boolean logic gates have been built with a single memristor. The operation makes use of the interaction of current spikes…

Neural network quantum states are a promising tool to analyze complex quantum systems given their representative power. It can however be difficult to optimize efficiently and effectively the parameters of this type of ansatz. Here we…

We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…

We present an idealized model involving interacting quantum dots that can support both the dynamical and geometrical forms of quantum computation. We show that by employing a structure similar to the one used in the Aharonov-Bohm effect we…

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but…