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

BeraDebajyoti, FennerS., GreenF., HomerS.

Published Jan 1, 2010• 7 citations
Publisher

Abstract

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...
DOI
10.5555/2011438.2011440

Related papers

Efficient universal quantum circuits

D. Bera, Stephen Fenner, F. Green +1 more

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.

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

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

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 Universal Quantum Circuits

Debajyoti Bera, Stephen Fenner, Frederic Green +1 more

Lecture notes in computer science•Jan 1, 2009•2 citations

On Efficient Universal Quantum Circuits

智 田湯, Satoshi Tayu, 朋輝 山田 +3 more

•Nov 1, 2011•0 citations

Quantum Circuits That Can Be Simulated Classically in Polynomial Time

Leslie Gabriel Valiant

A model of quantum computation based on unitary matrix operations was introduced by Feynman and Deutsch. It has been asked whether the power of this model exceeds that of classical Turing machines. We show here that a significant class of these quantum computations can be simulated classically in polynomial time. In particular we show that two-bit operations characterized by 4 × 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynomial time. This contrasts with the known universality of two-bit operations and demonstrates that efficient quantum computation of restricted classes is reconcilable with the Polynomial Time Turing Hypothesis. Therefore, it is possible that, The techniques introduced bring the quantum computational model within the realm of algebraic complexity theory. In a manner consistent with one view of quantum physics, the wave function is simulated deterministically, and randomization arises only in the course of making measurements. The results generalize the quantum model in that they do not require the matrices to be unitary. In a different direction these techniques also yield deterministic polynomial time algorithms for the decision and parity problems for certain classes of read-twice Boolean formulae. All our results are based on the use of gates that are defined in terms of their graph matching properties.

SIAM Journal on Computing•Jan 1, 2002•310 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.
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.
A model of quantum computation based on unitary matrix operations was introduced by Feynman and Deutsch. It has been asked whether the power of this model exceeds that of classical Turing machines. We show here that a significant class of these quantum computations can be simulated classically in polynomial time. In particular we show that two-bit operations characterized by 4 × 4 matrices in which the sixteen entries obey a set of five polynomial relations can be composed according to certain rules to yield a class of circuits that can be simulated classically in polynomial time. This contrasts with the known universality of two-bit operations and demonstrates that efficient quantum computation of restricted classes is reconcilable with the Polynomial Time Turing Hypothesis. Therefore, it is possible that, The techniques introduced bring the quantum computational model within the realm of algebraic complexity theory. In a manner consistent with one view of quantum physics, the wave function is simulated deterministically, and randomization arises only in the course of making measurements. The results generalize the quantum model in that they do not require the matrices to be unitary. In a different direction these techniques also yield deterministic polynomial time algorithms for the decision and parity problems for certain classes of read-twice Boolean formulae. All our results are based on the use of gates that are defined in terms of their graph matching properties.