Related papers: Efficient multi-qubit subspace rotations via topol…
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range…
Inspired by the classical phenomenon of random walk, the concept of quantum walk has emerged recently as a powerful platform for the dynamical simulation of complex quantum systems, entanglement production and universal quantum computation.…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
In this study, we utilized the quantum flow (QFlow) method to perform quantum simulations of correlated systems. The QFlow approach allows for sampling large sub-spaces of the Hilbert space by solving coupled variational problems in reduced…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons…
Discrete-time quantum walks have been shown to simulate all known topological phases in one and two dimensions. Being periodically driven quantum systems, their topological description, however, is more complex than that of closed…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically…
Taking the excess electron spin in a unit cell of semiconductor multiple quantum-dot structure as a qubit, we can implement scalable quantum computation without resorting to spin-spin interactions. The technique of single electron…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J.…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We discuss the implementation of frequency selective rotations using sequences of hard pulses and delays. These rotations are suitable for implementing single qubit gates in Nuclear Magnetic Resonance (NMR) quantum computers, but can also…
An efficient technique of computing on encrypted data allows a client with limited capability to perform complex operations on a remote fault-tolerant server without leaking anything about the input or output. Quantum computing provides…
As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations. There are three constraints that have to be satisfied: the order or dependency of…
Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…
A foundational assumption of quantum error correction theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Two major challenges that could become fundamental roadblocks…
We present a novel scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary X and Z rotations are…
A fundamental goal in the manipulation of quantum systems is the achievement of many coherent oscillations within the characteristic dephasing time T2*[1]. Most manipulations of electron spins in quantum dots have focused on the…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…