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

Cambridge University Press eBooks

Per Qubit Computational Power

Peter P. Rohde

Published Sep 9, 2021• 0 citations
Publisher
DOI
10.1017/9781108868815.042

Related papers

Computation with Qubits

WORLD SCIENTIFIC eBooks•Oct 28, 2013•0 citations

Entangling power in deterministic quantum computation with one qubit

Chang‐shui Yu, X. X. Yi, He‐Shan Song +1 more

Deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the normalized trace of the unitary matrix can be directly described by the entangling power of the quantum circuit of DQC1, so the nontrivial DQC1 is always accompanied by nonvanishing entangling power. In addition, it is shown that the entangling power also determines the intrinsic complexity of this quantum computation algorithm, i.e., larger entangling power corresponds to higher complexity. In addition, it is also shown that nonvanishing entangling power always exists in other similar tasks of DQC1.

arXiv:1307.1196•Physical Review A•Feb 19, 2013•8 citations

The Power of One Clean Qubit

Leonard Susskind

SpringerBriefs in physics•Jan 1, 2020•1 citation

Complexity Bounds for Quantum Computation

Steven Homer

This project focused on upper and lower bounds for quantum computability using constant depth quantum circuits, and on the complexity theory of such circuits. It established significant differences between resource bounded quantum and classical computation models, particularly emphasizing new examples of where quantum circuits are more powerful than their classical counterparts. A second focus and outgrowth of this work was the creation of efficient quantum algorithms for specific problems and central combinatorial functions. Recent finding include upper bounds for the computational power of constant depth circuits composed of single qubit and CNOT gates, and lower bounds for the computational power of constant depth circuits with single qubit, CNOT and fanout gates. These results represent the power and the limits of small, possibly realizable quantum circuits. Also examined were bounds on computations with additional storage qubits (ancillae), and natural simple functions (realized by small depth circuits) which require ancillae for their computation.

•Jun 22, 2007•0 citations

Energy and power scaling in quantum computers based on rotated surface codes with silicon flip-flop qubits

Marco De Michielis, Elena Ferraro

Abstract Scalable solutions are essential to achieving the long-term goal of building a fault-tolerant quantum computer and energy-power consumption are fundamental limiting factors for this target. Among the available types of silicon qubits, this work focuses on Flip-Flop (FF) qubits. Energy consumption and power requirements are estimated for a square array of qubits that hosts the logical qubit. The logical qubit is implemented using the rotated Surface Code (SC) for Quantum Error Correction (QEC). By using a universal set of quantum gates, the energy usage, time and power requirements for a SC cycle are estimated based on noise level, code distance and control levels. These estimates are used to provide insights into the main scaling-up challenges for quantum computer development. This is achieved by extending a thermal model that includes energy contributions from both the cryogenic components (such as the qubit array, the cryogenic control electronics, and the cryostat) and the room temperature (RT) section (RT electronics and heat dissipation systems). The maximum numbers of physical and logical qubits are provided, as well as power consumption across the different temperature sections.

EPJ Quantum Technology•Jun 2, 2025•2 citations

Computation with Qubits

WORLD SCIENTIFIC eBooks•Jul 15, 2020•0 citations
Deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the normalized trace of the unitary matrix can be directly described by the entangling power of the quantum circuit of DQC1, so the nontrivial DQC1 is always accompanied by nonvanishing entangling power. In addition, it is shown that the entangling power also determines the intrinsic complexity of this quantum computation algorithm, i.e., larger entangling power corresponds to higher complexity. In addition, it is also shown that nonvanishing entangling power always exists in other similar tasks of DQC1.
This project focused on upper and lower bounds for quantum computability using constant depth quantum circuits, and on the complexity theory of such circuits. It established significant differences between resource bounded quantum and classical computation models, particularly emphasizing new examples of where quantum circuits are more powerful than their classical counterparts. A second focus and outgrowth of this work was the creation of efficient quantum algorithms for specific problems and central combinatorial functions. Recent finding include upper bounds for the computational power of constant depth circuits composed of single qubit and CNOT gates, and lower bounds for the computational power of constant depth circuits with single qubit, CNOT and fanout gates. These results represent the power and the limits of small, possibly realizable quantum circuits. Also examined were bounds on computations with additional storage qubits (ancillae), and natural simple functions (realized by small depth circuits) which require ancillae for their computation.
Abstract Scalable solutions are essential to achieving the long-term goal of building a fault-tolerant quantum computer and energy-power consumption are fundamental limiting factors for this target. Among the available types of silicon qubits, this work focuses on Flip-Flop (FF) qubits. Energy consumption and power requirements are estimated for a square array of qubits that hosts the logical qubit. The logical qubit is implemented using the rotated Surface Code (SC) for Quantum Error Correction (QEC). By using a universal set of quantum gates, the energy usage, time and power requirements for a SC cycle are estimated based on noise level, code distance and control levels. These estimates are used to provide insights into the main scaling-up challenges for quantum computer development. This is achieved by extending a thermal model that includes energy contributions from both the cryogenic components (such as the qubit array, the cryogenic control electronics, and the cryostat) and the room temperature (RT) section (RT electronics and heat dissipation systems). The maximum numbers of physical and logical qubits are provided, as well as power consumption across the different temperature sections.