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

Fluctuation and Noise Letters

Comparison of Energy Requirements for Classical and Quantum Information Processing

Julio R. Gea-Banacloche, László B. Kish

Published Sep 1, 2003• 26 citations
Publisher

Abstract

By considering the energy requirements of quantum and classical computers we propose a criterion to separate the classical from the quantum regime and show that the classical scaling laws are much more favorable for conventional, general purpose computation.
DOI
10.1142/s021947750300135x

Related papers

Quantum Dynamics for Energetic Advantage in a Charge-Based Classical Full Adder

João P. Moutinho, Marco Pezzutto, Sagar Silva Pratapsi +5 more

A proposal for quantum-based classical computation shows how approaches from quantum computing may enable energy-efficient classical information processing and highlights energy costs that currently limit this technology.

arXiv:2206.14241•PRX Energy•Jul 12, 2023•6 citations

Reference Frames and Algorithms for Quantum Information Processing

Lana Sheridan

The main results of this thesis fall in to two areas, firstly quantum reference frames as a resource for quantum computations and secondly quantum algorithms. The results relating to quantum references consider their scaling with a requirements to perform measurements, operations and computations with a certain fidelity. For the case of a directional frame, the central question considered is of how many operations or measurements can be performed with it before its fidelity falls below some threshold. This is found to scale as the square of the size of the reference frame under for a range of physically interesting cases. To prove that result a new general form for any rotationally invariant map. This could have many applications is comparing and classifying rotationally invariant behaviour of quantum systems. Phase references are also considered for the case of performing quantum computations under an energy conservation law. The restriction that the expected energy be conserved for large quantum computations is shown to be manageable in many different potential architectures. In the case of completing computations is an energy conserving subspace, the requirements for ancillas are sublinear in the number of qubits, and even in a circuit model implementation, the errors due to phase reference imperfections are shown to not limit the apparent algorithmic improvements of quantum computing over classical computing. \n \nA quantum walk for the novel concept of two entangled walkers is proposed and analyzed. A modest improvement is found in the scaling of the expected separation of the walkers over the separable case. It illustrates the potential for making use of particle statistic behaviour in algorithms. Lastly, the relation between discrete and continuous time models of quantum computing is explored through the analysis of a new algorithm for simulating the Hamiltonian behaviour of a black box unitary operation. The scaling of the number of calls to the unitary required to obtain a simulation correct to within a parameter ϵ is found, as is a case where the efficiency of the algorithm is superior to directly applying the unitary repeatedly. Applications of the algorithm are considered.

•Aug 27, 2009•0 citations

Quantum Computation

Richard Hughes

In a conventional computer, information is represented by quantities that obey the laws of classical physics, such as the voltage levels in a logic circuit. But as the size of microelectronics shrinks, quantum physics becomes increasingly important.

Computing in Science & Engineering•Mar 1, 2001•3 citations

Separability Criterion of Bipartite Qubit States

BI Hong-mei

Generally,to decide a given quantum state to be entangled or not,or to be useful for quantum information processing purposes is a difficult question.In this note,the separability of quantum states in bipartite quantum systems is investigated.According to the analysis of the expanded form of density matrix in the separable quantum state and the relationship of expansion coefficient,a new separability criterion of bipartite quantum states is obtained: if a quantum state in a bipartite quantum system of arbitrary dimension is separable,the expansion coefficient satisfies certain inequality.This method requires only the dimensions of systems and the expansion coefficient of density matrix which can be easily got,and the computation is easy,so it has its application value.

Journal of Xi'an Technological University•Jan 1, 2008•0 citations

Demonstration of a quantum comparator on an ion-trap quantum device

Tatsuhiko N. Ikeda, Riku Nakama, Shunsuke Saeki +4 more

Quantum computers are believed to solve a class of computational problems that are based on modular arithmetic faster than classical computers. Among the arithmetic building blocks, comparison of integer pairs is a primitive. Here we report its demonstration in the Reimei quantum computer at RIKEN, whose trapped-ion architecture provides all-to-all qubit connectivity together with high gate fidelities. We observe high success probabilities for bit widths n = 3, 5, 7, and 9: Under a conventional output-only success criterion we obtain 95% at n=9; under a stricter criterion additionally requiring the ancilla to be correct, the success is 69% at n=9. These results demonstrate reliable quantum comparison at scales far beyond those previously achieved experimentally, not only for comparators but also in the broader context of quantum arithmetic circuits.

quant-pharXiv:2512.17779•Dec 22, 2025•0 citations

Are quantum computers really energy efficient?

Sophia Chen

Nature Computational Science•Jun 26, 2023•17 citations
The main results of this thesis fall in to two areas, firstly quantum reference frames as a resource for quantum computations and secondly quantum algorithms. The results relating to quantum references consider their scaling with a requirements to perform measurements, operations and computations with a certain fidelity. For the case of a directional frame, the central question considered is of how many operations or measurements can be performed with it before its fidelity falls below some threshold. This is found to scale as the square of the size of the reference frame under for a range of physically interesting cases. To prove that result a new general form for any rotationally invariant map. This could have many applications is comparing and classifying rotationally invariant behaviour of quantum systems. Phase references are also considered for the case of performing quantum computations under an energy conservation law. The restriction that the expected energy be conserved for large quantum computations is shown to be manageable in many different potential architectures. In the case of completing computations is an energy conserving subspace, the requirements for ancillas are sublinear in the number of qubits, and even in a circuit model implementation, the errors due to phase reference imperfections are shown to not limit the apparent algorithmic improvements of quantum computing over classical computing. \n \nA quantum walk for the novel concept of two entangled walkers is proposed and analyzed. A modest improvement is found in the scaling of the expected separation of the walkers over the separable case. It illustrates the potential for making use of particle statistic behaviour in algorithms. Lastly, the relation between discrete and continuous time models of quantum computing is explored through the analysis of a new algorithm for simulating the Hamiltonian behaviour of a black box unitary operation. The scaling of the number of calls to the unitary required to obtain a simulation correct to within a parameter ϵ is found, as is a case where the efficiency of the algorithm is superior to directly applying the unitary repeatedly. Applications of the algorithm are considered.
Generally,to decide a given quantum state to be entangled or not,or to be useful for quantum information processing purposes is a difficult question.In this note,the separability of quantum states in bipartite quantum systems is investigated.According to the analysis of the expanded form of density matrix in the separable quantum state and the relationship of expansion coefficient,a new separability criterion of bipartite quantum states is obtained: if a quantum state in a bipartite quantum system of arbitrary dimension is separable,the expansion coefficient satisfies certain inequality.This method requires only the dimensions of systems and the expansion coefficient of density matrix which can be easily got,and the computation is easy,so it has its application value.
Quantum computers are believed to solve a class of computational problems that are based on modular arithmetic faster than classical computers. Among the arithmetic building blocks, comparison of integer pairs is a primitive. Here we report its demonstration in the Reimei quantum computer at RIKEN, whose trapped-ion architecture provides all-to-all qubit connectivity together with high gate fidelities. We observe high success probabilities for bit widths n = 3, 5, 7, and 9: Under a conventional output-only success criterion we obtain 95% at n=9; under a stricter criterion additionally requiring the ancilla to be correct, the success is 69% at n=9. These results demonstrate reliable quantum comparison at scales far beyond those previously achieved experimentally, not only for comparators but also in the broader context of quantum arithmetic circuits.