Related papers: The Computational Power of Non-interacting Particl…
The number of superconducting qubits contained in a single quantum processor is increasing steadily. However, to realize a truly useful quantum computer, it is inevitable to increase the number of qubits much further by distributing quantum…
Progress in the reliable preparation, coherent propagation and efficient detection of many-body states has recently brought collective quantum phenomena of many identical particles into the spotlight. This tutorial introduces the physics of…
The steady increase in control over individual quantum systems has backed the dream of a quantum technology that provides functionalities beyond any classical device. Two particularly promising applications have been explored during the…
A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the…
We show how the spin independent scattering between two identical flying qubits can be used to implement an entangling quantum gate between them. We consider one dimensional models with a delta interaction in which the qubits undergoing the…
Boson Sampling is a task that is conjectured to be computationally hard for a classical computer, but which can be efficiently solved by linear-optical interferometers with Fock state inputs. Significant advances have been reported in the…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
In this paper, we study the quantum computation realized by an interaction-free measurement (IFM). Using Kwiat et al.'s interferometer, we construct a two-qubit quantum gate that changes one particle's trajectory according to whether or not…
Quantum computation, aiming at tackling hard problems beyond classical approaches, has been flourishing with each passing day. Unfortunately, a fully scalable and fault-tolerant universal quantum computer remains challenging based on the…
It is found that identical bosons (fermions) show generalized bunching (antibunching) property in linear networks: The absolute maximum (minimum) of probability that all $N$ input particles are detected in a subset of $\mathcal{K}$ output…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
Multiphoton interference is at the very heart of quantum foundations and applications in quantum sensing and information processing. In particular, boson sampling experiments have the potential to demonstrate quantum computational supremacy…
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…
BosonSampling is a restricted model of quantum computation proposed recently, where a non-adaptive linear-optical network is used to solve a sampling problem that seems to be hard for classical computers. Here we show that, even if the…
In gate-defined semiconductor spin qubits, the highly tunable Heisenberg exchange interaction is leveraged to implement fermionic two-qubit gates such as CZ and SWAP. However, the broader family of fermionic simulation (fSim) gates remains…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Quantum simulation of the interactions of fermions and bosons -- the fundamental particles of nature -- is essential for modeling complex quantum systems in material science, chemistry and high-energy physics and has been proposed as a…
We present a classical algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates. We achieve the promotion…
We theoretically propose a set of universal quantum gates acting on a hybrid qubit formed by coupling a quantum dot spin qubit and Majorana fermion qubit. First, we consider a quantum dot tunnel-coupled to two topological superconductors.…
Boson Sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialised quantum computer. Current experimental schemes, however, are still…