Showing quant-phShow all
3 papers · 1 filter
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…
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…
quant-ph2025
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…