Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.0261

An Introduction to Quantum Computing

Noson S. Yanofsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction to some of the ideas in quantum computing. The paper begins by motivating the central ideas of quantum mechanics and quantum computation with simple toy models. From there we move on to a formal presentation of the small fraction of (finite dimensional) quantum mechanics that we will need for basic quantum computation. Central notions of quantum architecture (qubits and quantum gates) are described. The paper ends with a presentation of one of the simplest quantum algorithms: Deutsch's algorithm. Our presentation demands neither advanced mathematics nor advanced physics.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Noson S. Yanofsky. 2007-08-02. An Introduction to Quantum Computing. https://arxiv.org/abs/0708.0261

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Modeling Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits

The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct - uniform random displacement errors - and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state read-out and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.

quant-ph↗
arXiv2026

Dynamical quantum phase transition with singular multipartite entanglement

We investigate the nonequilibrium quench dynamics of the one-dimensional transverse-field Ising model in both integrable and nonintegrable regimes. In particular, we report on a novel type of dynamical quantum phase transition (DQPT) that is characterized by a singular multipartite entanglement signature occurring at critical times in the post-quench dynamics. We show that this behavior is fundamentally distinct from previously studied DQPTs characterized by a nonanalytic rate function. We quantify the multipartite entanglement of the state by the quantum Fisher information and demonstrate that the DQPT belongs to a different universality class than the ground-state phase transition. Furthermore, we perform a spectral analysis of the DQPT and demonstrate that it is a genuine nonequilibrium transition arising from the constructive interference of excited states of the system during the many-body dynamics. Finally, we discuss potential experimental realizations in Rydberg platforms as well as applications in the context of quantum metrology.

quant-ph↗
arXiv2026

The Quantum Formalism Revisited

For the simple system of a point-like particle confined to a straight line, I compile, initially in a concise table, the structural elements of quantum mechanics and contrast them with those of classical (statistical) mechanics. Despite many similarities, there are the well-known fundamental differences, resulting from the algebraic non-commutativity in the quantal structure. The latter was discovered by Werner Heisenberg (1901-1976) in June 1925 on the small island of Helgoland in the North Sea, as a consequence of understanding atomic spectral data within a matrix scheme consistent with energy conservation. I discuss the differences and exemplify their quantifications by the variance and entropic indeterminacy inequalities, by (pseudo-)classical bounds on quantum canonical partition functions, and by the correlation inequalities of John Bell (1928-1990) and others.

quant-ph↗