Related papers: Decoupling with random quantum circuits
Decoherence originates from the leakage of quantum information into external degrees of freedom. For a qubit the two main decoherence channels are relaxation and dephasing. Here, we report an experiment on a superconducting qubit where we…
We employ optimal control theory to design optimized quantum gates for solid-state qubits subject to decoherence. At the example of a gate-controlled semiconductor quantum dot molecule we demonstrate that decoherence due to phonon couplings…
Decoherence in quantum computer memory due to the inevitable coupling to the external environment is examined. We take the assumption that all quantum bits (qubits) interact with the same environment rather than the assumption of separate…
The imputation of missing data is a common procedure in data analysis that consists in predicting missing values of incomplete data points. In this work we analyse a variational quantum circuit for the imputation of missing data. We…
The ability to connect distant qubits plays a fundamental role in quantum computing. Therefore, quantum systems candidates for quantum computation must be able to interact all their constituent qubits. Here, we model the quantum dot spin…
The advent of Quantum Computing has influenced researchers around the world to solve multitudes of computational problems with the promising technology. Feasibility of solutions for computational problems, and representation of various…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
Ref. 1 asked whether deleting gates from a random quantum circuit architecture can ever make the architecture a better approximate $t$-design. We show that it can. In particular, we construct a family of architectures such that the…
Quantum computers hold unprecedented potentials for machine learning applications. Here, we prove that physical quantum circuits are PAC (probably approximately correct) learnable on a quantum computer via empirical risk minimization: to…
We revisit the problem of switching off unwanted phase evolution and decoherence in a single two-state quantum system in the light of recent results on random dynamical decoupling methods [L. Viola and E. Knill, Phys. Rev. Lett. {\bf 94},…
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an…
As quantum processing units grow in size and precision we enter the stage where quantum algorithms can be tested on actual quantum devices. To implement a given quantum circuit on a given quantum device, one has to express the circuit in…
We consider a universal set of quantum gates encoded within a perturbed decoherence-free subspace of four physical qubits. Using second-order perturbation theory and a measuring device modeled by an infinite set of harmonic oscillators,…
Quantum computers have the potential to advance material design and drug discovery by performing costly electronic structure calculations. A critical aspect of this application requires optimizing the limited resources of the quantum…
A quantum memory interacts with its environment and loses information via decoherence as well as incoherence. A robust quantum control that prepares, preserves, and manipulates nonclassical correlations even in the presence of environmental…
Single atoms in dipole microtraps or optical tweezers have recently become a promising platform for quantum computing and simulation. Here we report a detailed theoretical analysis of the physics underlying an implementation of a Rydberg…
We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a…
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…
Quantum Entanglement is a fundamentally important resource in Quantum Information Science; however, generating it in practice is plagued by noise and decoherence, limiting its utility. Entanglement distillation and forward error correction…
We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles (circular unitary, orthogonal, and symplectic ensembles; CUE, COE and CSE). We utilise the established model of a…