This code builds a quantum sampling algorithm, equivalent to the classical computational methods from CST: 1, 2, 3. The quantum process is based on Layden's work on the Quantum enhanced Markov Chain Monte Carlo (QeMCMC), with the addition of the transitive closure constraint.
The project is ongoing - so routine updates should be expected.
For questions and suggestions, please contact Stuart Ferguson: [email protected]
This project was created by:
- Stuart Ferguson
Distributed under the MIT License. See LICENSE.txt for more information.
- QeMCMC by David Layden et al.
- Quantum-enhanced Markov Chain Monte Carlo for systems larger than your Quantum Computer by S. Ferguson and P. Wallden
- Qulacs Simulator
- Onset of the Asymptotic Regime for Finite Orders
- Dimensionally Restricted Causal Set Quantum Gravity: Examples in Two and Three Dimensions
- Evidence for a Phase Transition in 2D Causal Set Quantum Gravity.