Related papers: Stabilizer Circuits, Quadratic Forms, and Computin…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…
Finding the ground state of a quantum mechanical system can be formulated as an optimal control problem. In this formulation, the drift of the optimally controlled process is chosen to match the distribution of paths in the Feynman--Kac…
This is an investigation of the limits of quantum circuit simulation with Schrodinger's formulation and low precision arithmetic. The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled…
This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…
This work augments the recently introduced Stabilizer Tensor Network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford…
We employed the techniques from [Phys. Rev. A \textbf{70}, 052328 (2004)/arXiv:0406196] to analytically study two set of quantum circuits containing one $T$ gate/magic $|T\rangle = \frac{|0\rangle+\sqrt{i}|1\rangle}{\sqrt{2}}$ state. These…
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…
Reversible circuits for modular multiplication $Cx$%$M$ with $x<M$ arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and…
Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which…
There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic $\mathbb{F}_p$-vector spaces. In the language of the stabilizer…
Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…
Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run…
Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a…
We study the stability of the O(N) fixed point in three dimensions under perturbations of the cubic type. We address this problem in the three cases $N=2,3,4$ by using finite size scaling techniques and high precision Monte Carlo…
We reformulate the O(N) sigma model as a loop model whose configurations are the all-order strong coupling graphs of the original model. The loop configurations are represented by a pointer list in the computer and a Monte Carlo update…
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum…
Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms. We improve on this method by studying stabiliser decompositions of ZX…
Out-of-time-ordered-correlators (OTOCs) have been suggested as a means to diagnose chaotic behavior in quantum mechanical systems. Recently, it was found that OTOCs display exponential growth for the inverted quantum harmonic oscillator,…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…