It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic states on any number of qudits with any local Hilbert space dimension. This model leads to a classical simulation algorithm for universal quantum computation.Comment: 26 page
Consumption of magic states promotes the stabilizer model of computation to universal quantum comput...
Entanglement is generally considered necessary for achieving the Heisenberg limit in quantum metrolo...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
An important problem in quantum computation is to characterize the resources required for a computat...
Since they were first envisioned, quantum computers have oft been portrayed as devices of limitless ...
We present a new method for quantifying the resourcefulness of continuous-variable states in the con...
Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to p...
Quantum computers promise to solve important problems faster than conventional computers. However, u...
Quantum computers hold great promise to enhance machine learning, but their current qubit counts res...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-to...
Quantum simulation advantage over classical memory limitations would allow compact quantum circuits ...
The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivat...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
Much attention has been paid to dynamical simulation and quantum machine learning (QML) independentl...
Consumption of magic states promotes the stabilizer model of computation to universal quantum comput...
Entanglement is generally considered necessary for achieving the Heisenberg limit in quantum metrolo...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...
An important problem in quantum computation is to characterize the resources required for a computat...
Since they were first envisioned, quantum computers have oft been portrayed as devices of limitless ...
We present a new method for quantifying the resourcefulness of continuous-variable states in the con...
Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to p...
Quantum computers promise to solve important problems faster than conventional computers. However, u...
Quantum computers hold great promise to enhance machine learning, but their current qubit counts res...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Magic (non-stabilizerness) is a necessary but "expensive" kind of "fuel" to drive universal fault-to...
Quantum simulation advantage over classical memory limitations would allow compact quantum circuits ...
The development of a framework for quantifying ‘non-stabilizerness’ of quantum operations is motivat...
The development of a universal fault-tolerant quantum computer that can solve efficiently various di...
Much attention has been paid to dynamical simulation and quantum machine learning (QML) independentl...
Consumption of magic states promotes the stabilizer model of computation to universal quantum comput...
Entanglement is generally considered necessary for achieving the Heisenberg limit in quantum metrolo...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2019Cataloged from...