Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information and Computation

Efficient universal quantum circuits

D. Bera, Stephen Fenner, F. Green, Steven Homer

Published Jan 1, 2010• 8 citations
Publisher

Abstract

Universal circuits can be viewed as general-purpose simulators for central classes of circuits and can be used to capture the computational power of the circuit class being simulated. We define and construct quantum universal circuits which are efficient and has very little overhead in simulation. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here which is nearly optimal.

DOI
10.26421/qic10.1-2-2

Related papers

Universal Quantum Circuits

Debajyoti Bera, Stephen Fenner, Frederic Green +1 more

We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal.

arXiv:0804.2429•Apr 15, 2008•3 citations

Efficient universal quantum circuits

BeraDebajyoti, FennerS., GreenF. +1 more

Universal circuits can be viewed as general-purpose simulators for central classes ofcircuits and can be used to capture the computational power of the circuit class beingsimulated. We define and c...

Quantum Information and Computation•Jan 1, 2010•7 citations

On the simulation of quantum circuits

Richard Jozsa

We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the number of 2-qubit gates that touch or cross the line j i.e. the number of 2-qubit gates that are applied to qubits i,k with i \leq j \leq k. Let D=max_j D_j. Then the quantum process can be classically simulated in time n poly(2^D). Thus if D=O(log n) then C may be efficiently classically simulated.

arXiv:quant-ph/0603163•Mar 19, 2006•49 citations

ZENO: a new graphical tool for design and simulation of quantum circuits

Gustavo Eulalio M. Cabral, Bernardo Lula, Aércio Ferreira de Lima

Current technology for building digital computers is predicted to reach its limit within the next 10 years due to the increasing miniaturization of digital components. By reaching sizes of a few nanometers, electrons stop behaving as particles and start behaving as waves, obeying essentially the principles of Quantum Mechanics, and effects such as interference, superposition and entanglement become dominant. The utilization of those effects allows more that just an evolution of the miniaturization process. It allows for a computational parallelism impossible to be obtained efficiently through classical computational methods or devices. Several algorithms utilizing such effects have been proposed and indicated that Quantum Computation is significantly more efficient at solving certain class of problems than classical computation. Actually, there is not yet any hardware (a quantum computer) able to compute a useful algorithm outside of research labs. A turn-around to that problem is to simulate the behavior of a quantum computer by a classical computer. There are, to this day, a number of quantum computer simulators available which, in general, use the quantum circuit model defined by Deutsch. Just a few of them are universal. We have developed a novel universal quantum circuit simulator, called Zeno, to the design and test of quantum algorithms. Zeno offers a set of features that engulfs most of the features presented by the other existing universal quantum circuit simulators and that also allows it to be used in the design and simulation of quantum channels.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2005•1 citation

High arrangement group quantum circuits Hilbert spaces for in sequence special consideration

Kuchi Padmavathi, Yesuratnam Anitha Kumari

A quantum circuit is a model for Hilbert space computation in which a computation is a sequence of quantum spaces, which are reversible transformations on a quantum mechanical space of an n-bit register. This analogous structure is referred to as an n-space register. We define and can build efficient depth-universal and almost size-universal quantum circuits Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. The architecture scalability afforded by recent proposals of a large-scale photonic-based quantum space computer allows us to move on to a discussion of High performance Hilbert quantum circuits.

International Journal of Statistics and Applied Mathematics•May 1, 2018•0 citations

Efficient Algorithms for Universal Quantum Simulation

Barry C. Sanders

Abstract. A universal quantum simulator would enable efficient sim-ulation of quantum dynamics by implementing quantum-simulation al-gorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum sim-ulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed

•Aug 14, 2016•5 citations
Universal circuits can be viewed as general-purpose simulators for central classes of circuits and can be used to capture the computational power of the circuit class being simulated. We define and construct quantum universal circuits which are efficient and has very little overhead in simulation. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here which is nearly optimal.
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. We prove that this construction is nearly optimal.
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the number of 2-qubit gates that touch or cross the line j i.e. the number of 2-qubit gates that are applied to qubits i,k with i \leq j \leq k. Let D=max_j D_j. Then the quantum process can be classically simulated in time n poly(2^D). Thus if D=O(log n) then C may be efficiently classically simulated.
Current technology for building digital computers is predicted to reach its limit within the next 10 years due to the increasing miniaturization of digital components. By reaching sizes of a few nanometers, electrons stop behaving as particles and start behaving as waves, obeying essentially the principles of Quantum Mechanics, and effects such as interference, superposition and entanglement become dominant. The utilization of those effects allows more that just an evolution of the miniaturization process. It allows for a computational parallelism impossible to be obtained efficiently through classical computational methods or devices. Several algorithms utilizing such effects have been proposed and indicated that Quantum Computation is significantly more efficient at solving certain class of problems than classical computation. Actually, there is not yet any hardware (a quantum computer) able to compute a useful algorithm outside of research labs. A turn-around to that problem is to simulate the behavior of a quantum computer by a classical computer. There are, to this day, a number of quantum computer simulators available which, in general, use the quantum circuit model defined by Deutsch. Just a few of them are universal. We have developed a novel universal quantum circuit simulator, called Zeno, to the design and test of quantum algorithms. Zeno offers a set of features that engulfs most of the features presented by the other existing universal quantum circuit simulators and that also allows it to be used in the design and simulation of quantum channels.
A quantum circuit is a model for Hilbert space computation in which a computation is a sequence of quantum spaces, which are reversible transformations on a quantum mechanical space of an n-bit register. This analogous structure is referred to as an n-space register. We define and can build efficient depth-universal and almost size-universal quantum circuits Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the computational power of the circuit class being simulated. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here. The architecture scalability afforded by recent proposals of a large-scale photonic-based quantum space computer allows us to move on to a discussion of High performance Hilbert quantum circuits.
Abstract. A universal quantum simulator would enable efficient sim-ulation of quantum dynamics by implementing quantum-simulation al-gorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum sim-ulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed