8 citations · 13 across the 6 of their papers we have counts for
6 papers
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…
Information Thermodynamics of Agents: The Work Capacity of Channels with Memory
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…
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…
Fully quantum inflation: quantum marginal problem constraints in the service of causal inference
Isaac D. Smith, Elie Wolfe, Robert W. Spekkens
Consider the problem of deciding, for a particular multipartite quantum state, whether or not it is realizable in a quantum network with a particular causal structure. This is a fu…
Optimally generating using Pauli strings
Isaac D. Smith, Maxime Cautrès, David T. Stephen +1
Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. When this set is taken to consist of only products of Pauli operator…
Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
Isaac D. Smith, Hendrik Poulsen Nautrup, Hans J. Briegel
We show that universal parity quantum computing employing a recently introduced constant depth decoding procedure is equivalent to measurement-based quantum computation (MBQC) on a…