English
Related papers

Related papers: The Quantum Effect: A Recipe for QuantumPi

200 papers

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the…

Quantum Physics · Physics 2021-11-10 Tyler Volkoff , Zoë Holmes , Andrew Sornborger

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks.…

According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…

Quantum Physics · Physics 2007-05-23 P. Gralewicz

We provide a universal construction of the category of finite-dimensional C*-algebras and completely positive trace-nonincreasing maps from the rig category of finite-dimensional Hilbert spaces and unitaries. This construction, which can be…

Quantum Physics · Physics 2023-11-16 Pablo Andrés-MartíÂ-nez , Chris Heunen , Robin Kaarsgaard

In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented…

Computational Complexity · Computer Science 2014-01-29 Abuzer Yakaryilmaz , Rusins Freivalds , A. C. Cem Say , Ruben Agadzanyan

We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…

Quantum Physics · Physics 2026-03-06 Naren Manjunath , Vieri Mattei , Apoorv Tiwari , Tyler D. Ellison

We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using…

Quantum Physics · Physics 2010-10-21 Dan Shepherd , Michael J. Bremner

A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also…

Quantum Physics · Physics 2007-05-23 Thomas G. Draper

Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program…

Quantum Physics · Physics 2024-11-07 Eddie Schoute , Dmitry Grinko , Yigit Subasi , Tyler Volkoff

This note presents a simple and unified formulation of the most fundamental structures used in quantum information with qubits, arbitrary dimension qudits, and quantum continuous variables. This \emph{general quantum variables} construction…

Quantum Physics · Physics 2019-03-21 Timothy J Proctor

Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…

Quantum Physics · Physics 2007-05-23 K. Ch. Chatzisavvas , C. Daskaloyannis , C. P. Panos

Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…

Quantum Physics · Physics 2019-06-26 D. V. Fastovets , Yu. I. Bogdanov , B. I. Bantysh , V. F. Lukichev

$P$-divisibility is a central concept in both classical and quantum non-Markovian processes; in particular, it is strictly related to the notion of information backflow. When restricted to a fixed commutative algebra generated by a complete…

Quantum Physics · Physics 2024-11-27 Fabio Benatti , Dariusz Chruściński , Giovanni Nichele

This paper unites two research lines. The first involves finding categorical models of quantum programming languages and their type systems. The second line concerns the program of quantization of mathematical structures, which amounts to…

Mathematical Physics · Physics 2026-04-22 Andre Kornell , Bert Lindenhovius , Michael Mislove

Chemistry and materials science are widely regarded as potential killer application fields for quantum hardware. While the dream of unlocking unprecedented simulation capabilities remains compelling, quantum algorithm development must adapt…

Quantum Physics · Physics 2026-03-20 Davide Castaldo , Markus Reiher

Two models of computer, a quantum and a classical "chemical machine" designed to compute the relevant part of Shor's factoring algorithm are discussed. The comparison shows that the basic quantum features believed to be responsible for the…

Quantum Physics · Physics 2007-05-23 Robert Alicki

Quantum memory effects are essential in understanding and controlling open quantum systems, yet distinguishing them from classical memory remains challenging. We introduce a convex geometric framework to analyze quantum memory propagating…

Quantum Physics · Physics 2025-04-14 Mei Yu , Ties-A. Ohst , Hai-Chau Nguyen , Stefan Nimmrichter

As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to…

Quantum Physics · Physics 2025-06-19 Robin Ollive , Stephane Louise

Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two…

Quantum Physics · Physics 2007-12-10 A. Papageorgiou , J. F. Traub