Related papers: A simple method for sampling random Clifford opera…
Path sums are a convenient symbolic formalism for quantum operations with applications to the simulation, optimization, and verification of quantum protocols. Unlike quantum circuits, path sums are not limited to unitary operations, but can…
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum…
Output probability distributions of several sub-universal quantum computing models cannot be classically efficiently sampled unless some unlikely consequences occur in classical complexity theory, such as the collapse of the polynomial-time…
This thesis discusses the young fields of quantum pseudo-randomness and quantum learning algorithms. We present techniques for derandomising algorithms to decrease randomness resource requirements and improve efficiency. One key object in…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
The design and optimization of a large-scale fault-tolerant quantum computer architecture relies extensively on numerical simulations to assess the performance of each component of the architecture. The simulation of fault-tolerant gadgets,…
The compiling of quantum gates is crucial for the successful quantum algorithm implementations. The environmental noise as well as the bandwidth of control pulses pose a challenge to precise and fast qubit control, especially in a weakly…
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
We construct a quantum algorithm that creates the Laughlin state for an arbitrary number of particles $n$ in the case of filling fraction one. This quantum circuit is efficient since it only uses $n(n-1)/2$ local qudit gates and its depth…
Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an…
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…
We propose a sampling-based simulation for fault-tolerant quantum error correction under coherent noise. A mixture of incoherent and coherent noise, possibly due to over-rotation, is decomposed into Clifford channels with a quasiprobability…
We study operator scrambling in quantum circuits built from `super-Clifford' gates. For such circuits it was established in arXiv:2002.12824 that the time evolution of operator entanglement for a large class of many-body operators can be…
Due to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms,…
Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…
We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
With the recent claim of a quantum advantage demonstration in photonics by Zhong et al, the question of the computation of lower-order approximations of boson sampling with arbitrary quantum states at arbitrary distinguishability has come…