scientific article
From MaRDI portal
zbMath1152.81706arXivquant-ph/0505030MaRDI QIDQ3522568
Christopher M. Dawson, Michael A. Nielsen
Publication date: 3 September 2008
Full work available at URL: https://arxiv.org/abs/quant-ph/0505030
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Quantum computation (81P68) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to quantum theory (81-01)
Related Items
On Random Walks in Large Compact Lie Groups, On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem, How smooth is quantum complexity?, Quantum Implementation of Numerical Methods for Convection-Diffusion Equations: Toward Computational Fluid Dynamics, Expansion and random walks in \(\text{SL}_d(\mathbb{Z}/p^n\mathbb{Z})\). II., PEET: a Matlab tool for estimating physical gate errors in quantum information processing systems, Expansion in SL\(_2(\mathbb R)\) and monotone expanders, Quantum simulation from the bottom up: the case of rebits, The Toffoli-Hadamard gate system: an algebraic approach, Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets, Approximate quantum gates compilation for superconducting transmon qubits with self-navigation algorithm, Mathematical etudes on quantum computation, A dynamic programming approach to multi-objective logic synthesis of quantum circuits, Quantum QR decomposition in the computational basis, Advanced exact synthesis of Clifford+T circuits, Phase shift and multi-controlled \(Z\)-type gates, Hay from the haystack: explicit examples of exponential quantum circuit complexity, Quantum impossible differential attacks: applications to AES and SKINNY, The SWITCH test for discriminating quantum evolutions, Learning bounds for quantum circuits in the agnostic setting, A normal form for single-qudit Clifford+\(T\) operators, Large \(k\) topological quantum computer, Secure delegated quantum algorithms for solving Mahalanobis distance, Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity, Quantum circuits synthesis using Householder transformations, Unnamed Item, Instability of nondiscrete free subgroups in Lie groups, Topological quantum gate construction by iterative pseudogroup hashing, Quantum-circuit design for efficient simulations of many-body quantum dynamics, Faster quantum chemistry simulation on fault-tolerant quantum computers, An Introduction to Quantum Computing, without the Physics, Quantum algorithm design: techniques and applications, Floating point representations in quantum circuit synthesis, Quantum circuit design for accurate simulation of qudit channels, Random walks in Euclidean space, Product formulas for exponentials of commutators, Survey of control performance in quantum information processing, Expansion and random walks in \(\text{SL}_d(\mathbb{Z}/p^n\mathbb{Z})\). I., On the spectral gap for finitely-generated subgroups of \(\text{SU}(2)\), Solovay-Kitaev approximations of special orthogonal matrices, Revisiting the simulation of quantum Turing machines by quantum circuits, An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity, New results on expanders, A spectral gap theorem in SU\((d)\), Error bounds for approximations with deep ReLU networks, Operator complexity: a journey to the edge of Krylov space, Unnamed Item, Navigating directed Cayley graphs of small diameter: A potent Solovay–Kitaev procedure, Quantum random access stored-program machines, Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\), Canonical forms for single-qutrit Clifford+\(T\) operators, Bounding quantum gate error rate based on reported average fidelity, Sampling and Statistical Physics via Symmetry, The search for leakage-free entangling Fibonacci braiding gates, Syndrome measurement strategies for the \(7,1,3\) code, Constructing approximately diagonal quantum gates, Quantum security analysis of CSIDH
