Fetching the paper…
Reading the bibliography…
Energy consumption in solving computational problems has been gaining growing attention as one of the key performance measures for computers.
W. Nernst, Ueber die Berechnung chemischer Gleichgewichte aus thermischen Messungen, Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse 1906
1906
Earlier work this paper cites.
H. Weyl, Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen, Mathematische Annalen 71
1912
Earlier work this paper cites.
C. E. Shannon, The synthesis of two-terminal switching circuits, The Bell System Technical Journal 28
1949
Earlier work this paper cites.
H. Robbins, A remark on stirling’s formula, The American Mathematical Monthly 62
1955
Earlier work this paper cites.
R. Landauer, Irreversibility and Heat Generation in the Computing Process, IBM Journal of Research and Development 5
1961
Earlier work this paper cites.
C. H. Bennett, Logical reversibility of computation, IBM journal of Research and Development 17
1973
Earlier work this paper cites.
P. Benioff, Quantum mechanical models of turing machines that dissipate no energy, Phys. Rev. Lett. 48
1982
Earlier work this paper cites.
C. H. Bennett, The thermodynamics of computation—a review, International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
R. P. Feynman, Quantum mechanical computers, Foundations of Physics 16
1986
Earlier work this paper cites.
C. R. Johnson, Precise intervals for specific eigenvalues of a product of a positive definite and a Hermitian matrix, in Linear Algebra and its Applications , Vol. 117, edited by R. A. Brualdi and H. Schneider (1989) pp. 159–164
1989
Earlier work this paper cites.
D. Simon, On the power of quantum computation, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 116–123
1994
Earlier work this paper cites.
P. W. Shor, Fault-tolerant quantum computation, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science , FOCS ’96 (IEEE Computer Society, USA, 1996) p. 56
1996
Earlier work this paper cites.
D. Aharonov, M. Ben-Or, R. Impagliazzo, and N. Nisan, Limitations of noisy reversible computation (1996), arXiv:quant-ph/9611028 [quant-ph]
1996
Earlier work this paper cites.
D. R. Simon, On the power of quantum computation, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , STOC ’97 (Association for Computing Machinery, New York, NY, USA, 1997) p. 176
1997
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, Fault-Tolerant Quantum Computation with Constant Error, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , STOC ’97 (Association for Computing Machinery, New York, NY, USA, 1997) p. 176–188
1997
Earlier work this paper cites.
P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
E. Knill, R. Laflamme, and W. H. Zurek, Resilient quantum computation: error models and thresholds, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454
1998
Earlier work this paper cites.
T. Y. Chow, What is a Closed-Form Number?, The American Mathematical Monthly 106
1999
Earlier work this paper cites.
M. Horodecki, P. Horodecki, and R. Horodecki, General teleportation channel, singlet fraction, and quasidistillation, Phys. Rev. A 60
1999
Earlier work this paper cites.
S. R. Valluri, D. J. Jeffrey, and R. M. Corless, Some applications of the Lambert W {W} function to physics, Canadian Journal of Physics 78
2000
Earlier work this paper cites.
W. Fulton, Eigenvalues, invariant factors, highest weights, and Schubert calculus, Bulletin of the American Mathematical Society 37
2000
Earlier work this paper cites.
M. J. Dworkin, Advanced encryption standard (aes) , Federal Information Processing Standards Publication 197 (2001)
2001
Earlier work this paper cites.
H. Buhrman and R. de Wolf, Complexity measures and decision tree complexity: a survey, Theoretical Computer Science 288
2002
Earlier work this paper cites.
M. Ozawa, Conservative Quantum Computing, Phys. Rev. Lett. 89
2002
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
J. Daemen and V. Rijmen, The design of Rijndael: AES — the Advanced Encryption Standard (Springer-Verlag, 2002) p. 238
2002
Earlier work this paper cites.
M. A. Nielsen, A simple formula for the average gate fidelity of a quantum dynamical operation, Physics Letters A 303
2002
Earlier work this paper cites.
J. Watrous, On the complexity of simulating space-bounded quantum computations, Comput. Complex. 12
2004
Earlier work this paper cites.
M. Ettinger, P. Høyer, and E. Knill, The quantum query complexity of the hidden subgroup problem is polynomial, Information Processing Letters 91
2004
Earlier work this paper cites.
B. M. Terhal and G. Burkard, Fault-tolerant quantum computation for local non-markovian noise, Phys. Rev. A 71
2005
Earlier work this paper cites.
P. Koiran, V. Nesme, and N. Portier, A Quantum Lower Bound for the Query Complexity of Simon’s Problem, in Automata, Languages and Programming , edited by L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung (Springer Berlin Heidelberg, Berlin, Heidelberg, 2005) pp. 1287–1298
2005
Earlier work this paper cites.
J. Gea-Banacloche and M. Ozawa, Minimum-energy pulses for quantum logic cannot be shared, Phys. Rev. A 74
2006
Earlier work this paper cites.
P. Aliferis, D. Gottesman, and J. Preskill, Quantum accuracy threshold for concatenated distance-3 codes, Quantum Info. Comput. 6
2006
Earlier work this paper cites.
B. W. Reichardt, Fault-tolerance threshold for a distance-three quantum code, in Proceedings of the 33rd International Conference on Automata, Languages and Programming - Volume Part I , ICALP’06 (Springer-Verlag, Berlin, Heidelberg, 2006) p. 50–61
2006
Earlier work this paper cites.
Z. Zhang, Estimating mutual information via kolmogorov distance, IEEE Transactions on Information Theory 53
2007
Earlier work this paper cites.
K. M. R. Audenaert, A sharp continuity estimate for the von neumann entropy, Journal of Physics A: Mathematical and Theoretical 40
2007
Earlier work this paper cites.
S. Goldwasser and M. Bellare, Lecture notes on cryptography, Summer course “Cryptography and computer security” at MIT (2008)
2008
Earlier work this paper cites.
D. Petz, Quantum Information Theory and Quantum Statistics , 1st ed. (Springer Berlin Heidelberg, 2008)
2008
Earlier work this paper cites.
J. Watrous, Quantum Computational Complexity, in Encyclopedia of Complexity and Systems Science , edited by R. A. Meyers (Springer New York, New York, NY, 2009) pp. 7174–7201
2009
Earlier work this paper cites.
S. Arora and B. Barak, Computational Complexity: A Modern Approach (Cambridge University Press, 2009)
2009
Earlier work this paper cites.
D. Shepherd and M. J. Bremner, Temporally unstructured quantum computation, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 465
2009
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information , 10th ed. (Cambridge University Press, 2010)
2010
Cited alongside, same era.
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, in Quantum information science and its contributions to mathematics , Proceedings of Symposia in Applied Mathematics, Vol. 68 (American Mathematical Society, Providence, Rhode Island, 2010) pp. 13–58
2010
Cited alongside, same era.
O. A. Mukhanov, Energy-efficient single flux quantum technology, IEEE Transactions on Applied Superconductivity 21
2011
Cited alongside, same era.
L. d. Rio, J. Åberg, R. Renner, O. Dahlsten, and V. Vedral, The thermodynamic meaning of negative entropy, Nature 474
Google Quantum AI, Quantum supremacy using a programmable superconducting processor, Nature 574
2019
Later among the works it cites.
K. Proesmans, J. Ehrich, and J. Bechhoefer, Finite-time landauer principle, Phys. Rev. Lett. 125
2020
Later among the works it cites.
H. Tajima, N. Shiraishi, and K. Saito, Coherence cost for violating conservation laws, Phys. Rev. Res. 2
2020
Later among the works it cites.
Y. Guryanova, N. Friis, and M. Huber, Ideal Projective Measurements Have Infinite Resource Costs, Quantum 4
2020
Later among the works it cites.
A. Serafini, M. Lostaglio, S. Longden, U. Shackerley-Bennett, C.-Y. Hsieh, and G. Adesso, Gaussian Thermal Operations and The Limits of Algorithmic Cooling, Phys. Rev. Lett. 124
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing , STOC ’11 (Association for Computing Machinery, New York, NY, USA, 2011) p. 333–342
2011
Cited alongside, same era.
M. J. Bremner, R. Jozsa, and D. J. Shepherd, Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467
2011
Cited alongside, same era.
E. Magesan, R. Blume-Kohout, and J. Emerson, Gate fidelity fluctuations and quantum process invariants, Phys. Rev. A 84
2011
Cited alongside, same era.
A. G. Fowler, Proof of finite surface code threshold for matching, Phys. Rev. Lett. 109
2012
Cited alongside, same era.
F. G. S. L. Brandão, M. Horodecki, J. Oppenheim, J. M. Renes, and R. W. Spekkens, Resource Theory of Quantum States Out of Thermal Equilibrium, Phys. Rev. Lett. 111
2013
Cited alongside, same era.
2013
Cited alongside, same era.
D. Reeb and M. M. Wolf, An improved Landauer principle with finite-size corrections, New Journal of Physics 16
2014
Cited alongside, same era.
S. Jaques, M. Naehrig, M. Roetteler, and F. Virdia, Implementing grover oracles for quantum key search on AES and LowMC, in Advances in Cryptology – EUROCRYPT 2020 (Springer International Publishing, 2020) pp. 280–310
2020
Later among the works it cites.
H.-S. Zhong, H. Wang, Y.-H. Deng, M.-C. Chen, L.-C. Peng, Y.-H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X.-Y. Yang, W.-J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.-L. Liu, C.-Y. Lu, and J.-W. Pan, Quantum computational advantage using photons, Science 370
2020
Later among the works it cites.
H.-Y. Huang, R. Kueng, and J. Preskill, Information-theoretic bounds on quantum advantage in machine learning, Phys. Rev. Lett. 126
2021
Later among the works it cites.
G. Chiribella, Y. Yang, and R. Renner, Fundamental Energy Requirement of Reversible Quantum Operations, Phys. Rev. X 11
2021
Later among the works it cites.
Q. Dong, M. T. Quintino, A. Soeda, and M. Murao, Success-or-draw: A strategy allowing repeat-until-success in quantum computation, Phys. Rev. Lett. 126
2021
Later among the works it cites.
A. Auffèves, Quantum Technologies Need a Quantum Energy Initiative, PRX Quantum 3
2022
Later among the works it cites.
M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, Challenges and opportunities in quantum machine learning, Nature Computational Science 2
2022
Later among the works it cites.
D. Aharonov, J. Cotler, and X.-L. Qi, Quantum algorithmic measurement, Nature communications 13
2022
Later among the works it cites.
S. Chen, J. Cotler, H.-Y. Huang, and J. Li, Exponential separations between learning with and without quantum memory, in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) pp. 574–585
2022
Later among the works it cites.
H.-Y. Huang, M. Broughton, J. Cotler, S. Chen, J. Li, M. Mohseni, H. Neven, R. Babbush, R. Kueng, J. Preskill, and J. R. McClean, Quantum advantage in learning from experiments, Science 376
2022
Later among the works it cites.
T. Van Vu and K. Saito, Finite-time quantum landauer principle and quantum coherence, Phys. Rev. Lett. 128
2022
Later among the works it cites.
J. Stevens, D. Szombati, M. Maffei, C. Elouard, R. Assouly, N. Cottet, R. Dassonneville, Q. Ficheux, S. Zeppetzauer, A. Bienfait, A. N. Jordan, A. Auffèves, and B. Huard, Energetics of a Single Qubit Gate, Phys. Rev. Lett. 129
2022
Later among the works it cites.
Y. Yang, R. Renner, and G. Chiribella, Energy requirement for implementing unitary gates on energy-unbounded systems, Journal of Physics A: Mathematical and Theoretical 55
2022
Later among the works it cites.
R. R. Soldati, D. B. R. Dasari, J. Wrachtrup, and E. Lutz, Thermodynamics of a minimal algorithmic cooling refrigerator, Phys. Rev. Lett. 129
2022
Later among the works it cites.
F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, and P. Zimmermann, IEEE Security & Privacy 20
2022
Later among the works it cites.
R. Cleve, Lecture notes: Introduction to quantum information processing, part 2, quantum algorithms (i) (2022)
2022
Later among the works it cites.
K. Jang, A. Baksi, H. Kim, G. Song, H. Seo, and A. Chattopadhyay, Quantum analysis of aes , Cryptology ePrint Archive, Paper 2022/683 (2022), https://eprint.iacr.org/2022/683
2022
Later among the works it cites.
T. Yamakawa and M. Zhandry, Verifiable quantum advantage without structure, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, USA, 2022) pp. 69–74
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
D. Jaschke and S. Montangero, Is quantum computing green? an estimate for an energy-efficiency quantum advantage, Quantum Science and Technology 8
2023
Closest in time.
M. Fellous-Asiani, J. H. Chai, Y. Thonnart, H. K. Ng, R. S. Whitney, and A. Auffèves, Optimizing resource efficiencies for scalable full-stack quantum computers, PRX Quantum 4
2023
Closest in time.
P. Taranto, F. Bakhshinezhad, A. Bluhm, R. Silva, N. Friis, M. P. E. Lock, G. Vitagliano, F. C. Binder, T. Debarba, E. Schwarzhans, F. Clivaz, and M. Huber, Landauer versus nernst: What is the true cost of cooling a quantum system?, PRX Quantum 4
2023
Closest in time.
H.-Y. Huang, S. Chen, and J. Preskill, Learning to predict arbitrary quantum processes, PRX Quantum 4
2023
Closest in time.
A. Rolandi and M. Perarnau-Llobet, Finite-time Landauer principle beyond weak coupling, Quantum 7
2023
Closest in time.
L. Buffoni and M. Campisi, Cooperative quantum information erasure, Quantum 7
2023
Closest in time.
A. Rolandi, P. Abiuso, and M. Perarnau-Llobet, Collective advantages in finite-time thermodynamics, Phys. Rev. Lett. 131
2023
Closest in time.
X. Jiang, J. Scott, M. Friesen, and M. Saffman, Sensitivity of quantum gate fidelity to laser phase and intensity noise, Phys. Rev. A 107
2023
Closest in time.
2023
Closest in time.
H. Tajima, private communication (2023)
2023
Closest in time.
2024
Closest in time.
H. Yamasaki and M. Koashi, Time-efficient constant-space-overhead fault-tolerant quantum computation, Nature Physics 20
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
Wikipedia, Orders of magnitude (energy) (2004), [Online; accessed 10-June-2024]
2024
Closest in time.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 626
2024
Closest in time.