512 citations · 765 across the 16 of their papers we have counts for
17 papers
Efficient Record-and-Replay Arithmetic for Quantum Elliptic-Curve Point Addition
Jieyi Long, Theodore Pender, Zhao Huang +33
We study reversible secp256k1 point-addition circuits developed through ECDSA.Fail for Shor's elliptic-curve discrete-logarithm algorithm. Two complementary constructions improve r…
ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm
Jieyi Long, Theodore Pender, Zhao Huang +33
We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, optimizing…
Kardashev scale Quantum Computing for Bitcoin Mining
Pierre-Luc Dallaire-Demers, BTQ Technologies Team
Bitcoin already faces a quantum threat through Shor attacks on elliptic-curve signatures. This paper isolates the other component that public discussion often conflates with it: mi…
Brace for impact: ECDLP challenges for quantum cryptanalysis
Pierre-Luc Dallaire-Demers, William Doyle, Timothy Foo
Precise suites of benchmarks are required to assess the progress of early fault-tolerant quantum computers at economically impactful applications such as cryptanalysis. Appropriate…
Quantum supremacy regime for compressed fermionic models
Guillermo Blázquez-Cruz, Pierre-Luc Dallaire-Demers
Compressible models extend the domain of simulable systems in quantum computers, but little is known about their precise limits of applicability. Using the theory of compressible m…
Connecting geometry and performance of two-qubit parameterized quantum circuits
Amara Katabarwa, Sukin Sim, Dax Enshan Koh +1
Parameterized quantum circuits (PQCs) are a central component of many variational quantum algorithms, yet there is a lack of understanding of how their parameterization impacts alg…
Roadmap for quantum simulation of the fractional quantum Hall effect
Michael Kaicher, Simon Balthasar Jäger, Pierre-Luc Dallaire-Demers +1
A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems. In this work, we present a detailed roadm…
An application benchmark for fermionic quantum simulations
Pierre-Luc Dallaire-Demers, Michał Stęchły, Jerome F. Gonthier +3
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid e…
Molecular Realization of a Quantum NAND Tree
Phillip W. K. Jensen, Chengjun Jin, Pierre-Luc Dallaire-Demers +2
The negative-AND (NAND) gate is universal for classical computation making it an important target for development. A seminal quantum computing algorithm by Farhi, Goldstone and Gut…
Quantum generative adversarial networks
Pierre-Luc Dallaire-Demers, Nathan Killoran
Quantum machine learning is expected to be one of the first potential general-purpose applications of near-term quantum devices. A major recent breakthrough in classical machine le…
Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer
Pierre-Luc Dallaire-Demers, Jonathan Romero, Libor Veis +2
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these t…
Gaussian Boson Sampling for perfect matchings of arbitrary graphs
Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost +2
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of…
Benchmarking non-simulable quantum processes via symmetry conservation
Tobias Chasseur, Felix Motzoi, Michael Kaicher +2
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simul…
Quantum Information and Computation for Chemistry
Jonathan Olson, Yudong Cao, Jonathan Romero +7
The NSF Workshop in Quantum Information and Computation for Chemistry assembled experts from directly quantum-oriented fields such as algorithms, chemistry, machine learning, optic…
Implementation of the iFREDKIN gate in scalable superconducting architecture for the quantum simulation of Fermionic systems
Per J. Liebermann, Pierre-Luc Dallaire-Demers, Frank K. Wilhelm
We present a Superconducting Planar ARchitecture for Quantum Simulations (SPARQS) intended to implement a scalable qubit layout for quantum simulators. To this end, we describe the…
Quantum gates and architecture for the quantum simulation of the Fermi-Hubbard model
Pierre-Luc Dallaire-Demers, Frank K. Wilhelm
Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materi…
A method to efficiently simulate the thermodynamical properties of the Fermi-Hubbard model on a quantum computer
Pierre-Luc Dallaire-Demers, Frank K. Wilhelm
Many phenomena of strongly correlated materials are encapsulated in the Fermi-Hubbard model whose thermodynamical properties can be computed from its grand canonical potential acco…