English
Related papers

Related papers: Classical Computation by Quantum Bits

200 papers

An open quantum walk formalism for dissipative quantum computing is presented. The approach is illustrated with the examples of the Toffoli gate and the Quantum Fourier Transform for 3 and 4 qubits. It is shown that the algorithms based on…

Quantum Physics · Physics 2014-01-28 I. Sinayskiy , F. Petruccione

We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…

Quantum Gases · Physics 2012-05-22 Philipp-Immanuel Schneider , Alejandro Saenz

Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…

Quantum Physics · Physics 2019-08-20 Brian R. La Cour , S. Andrew Lanham , Corey I. Ostrove

We have designed efficient quantum circuits for the three-qubit Toffoli (controlled-controlled NOT) and the Fredkin (controlled-SWAP) gate, optimized via genetic programming methods. The gates thus obtained were experimentally implemented…

Quantum Physics · Physics 2018-02-13 Amit Devra , Prithviraj Prabhu , Harpreet Singh , Arvind , Kavita Dorai

Quantum computations promise the ability to solve problems intractable in the classical setting. Restricting the types of computations considered often allows to establish a provable theoretical advantage by quantum computations, and later…

Quantum Physics · Physics 2021-11-19 Dmitri Maslov , Jin-Sung Kim , Sergey Bravyi , Theodore J. Yoder , Sarah Sheldon

Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…

Quantum Physics · Physics 2013-05-29 Andrew M. Steane , Ben Ibinson

We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…

Quantum Physics · Physics 2023-11-07 Thorsten B. Wahl , Sergii Strelchuk

The Toffoli gate is an essential logic element, which permits implementation of a reversible processor. It is of relevance both for classical as well as quantum logics. We propose and theoretically study all-optical implementations of…

Quantum Physics · Physics 2013-06-11 G. Grigoryan , V. Chaltykyan , E. Gazazyan , O. Tikhova , T. Halfmann

A single physical interaction might not be universal for quantum computation in general. It has been shown, however, that in some cases it can generate universal quantum computation over a subspace. For example, by encoding logical qubits…

Quantum Physics · Physics 2007-05-23 M. Hsieh , J. Kempe , S. Myrgren , K. B. Whaley

All computation is physically embedded. Reflecting this, a growing body of results embraces rate equations as the underlying mechanics of thermodynamic computation and biological information processing. Strictly applying the implied…

Statistical Mechanics · Physics 2021-06-09 Kyle J. Ray , Gregory W. Wimsatt , Alexander B. Boyd , James P. Crutchfield

Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…

Quantum Physics · Physics 2025-10-15 Josey Stevens , Sebastian Deffner

Autonomous quantum machines (AQMs) execute tasks without requiring time-dependent external control. Motivations for AQMs include the restrictions imposed by classical control on quantum machines' coherence times and geometries. Most AQM…

It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations…

Quantum Physics · Physics 2007-05-23 O. J. E. Maroney

We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…

Quantum Physics · Physics 2014-11-18 Dima Mozyrsky , Vladimir Privman , Steven P. Hotaling

The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic operations on quantum data, e.g., reversible arithmetic circuits. In physical implementations, however, TOFFOLI gates are decomposed into six CNOT gates…

Quantum Physics · Physics 2011-11-03 Vivek V. Shende , Igor L. Markov

An algorithm for reversible logic synthesis is proposed. The task is, for a given $n$-bit substitution map $P_n: \{0,1\}^n \rightarrow \{0,1\}^n$, to find a sequence of reversible logic gates that implements the map. The gate library…

Logic in Computer Science · Computer Science 2024-07-24 Hochang Lee , Kyung Chul Jeong , Daewan Han , Panjin Kim

The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…

Quantum Physics · Physics 2019-04-11 Sergey Bravyi , David Gosset

Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…

Current technologies in quantum-based communications bring a new integration of quantum data with classical data for hybrid processing. However, the frameworks of these technologies are restricted to a single classical or quantum task,…

Quantum Physics · Physics 2022-09-02 Quoc Hoan Tran , Sanjib Ghosh , Kohei Nakajima

We consider quantum computation efficiency from a new perspective. The efficiency is reduced to its classical counterpart by imposing the semi-classical limit. We show that this reduction is caused by the fact that any elementary quantum…

Quantum Physics · Physics 2019-11-11 Maksym Teslyk , Olena Teslyk