Related papers: Classically efficient regimes in measurement based…
We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
This paper presents a highly efficient decomposition scheme and its associated Mathematica notebook for the analysis of complicated quantum circuits comprised of single/multiple qubit and qudit quantum gates. In particular, this scheme…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
Due to its unique scalability potential, continuous variable quantum optics is a promising platform for large scale quantum computing. In particular, very large cluster states with a two-dimensional topology that are suitable for universal…
We explore the flow of quantum correlations in cluster states defined on ladder type graphs as measurements are done on qubits located on the nodes of the cluster. We focus on three qubits at the end of the ladder and compute the…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in contrast to…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to 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…
We discuss the desired criteria for a two-qubit phase gate and present a method for realising such a gate for quantum computation that is measurement-free and low error. The gate is implemented between qubits via an intermediate bus mode.…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…