3 papers
quant-ph2025
Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation
Thierry N. Kaldenbach, Isaac D. Smith, Hendrik Poulsen Nautrup +2
The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gate…
cs.LG2025
The Work Capacity of Channels with Memory: Maximum Extractable Work in Percept-Action Loops
Lukas J. Fiderer, Paul C. Barth, Isaac D. Smith +1
Predicting future observations plays a central role in machine learning, biology, economics, and many other fields. It lies at the heart of organizational principles such as the va…
quant-ph2025
Minimally Universal Parity Quantum Computing
Isaac D. Smith, Berend Klaver, Hendrik Poulsen Nautrup +2
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a co…