Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.03559 v1 pith:7YEVMOCO submitted 2023-04-07 gr-qc hep-thquant-ph

Quantum circuits for the Ising spin networks

classification gr-qc hep-thquant-ph
keywords quantumspincircuitsisingnetworkstatescomputingconstructing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Spin network states are a powerful tool for constructing the $SU(2)$ gauge theories on a graph. In loop quantum gravity (LQG), they have yielded many promising predictions, although progress has been limited by the computational challenge of dealing with high-dimensional Hilbert spaces. To explore more general configurations, quantum computing methods can be applied by representing spin network states as quantum circuits. In this article, we introduce an improved method for constructing quantum circuits for 4-valent Ising spin networks, which utilizes a smaller number of qubits than previous approaches. This has practical implications for the implementation of quantum circuits. We also demonstrate the procedure with various examples, including the construction of a 10-node Ising spin network state. The key ingredient of the method is the variational transfer of partial states, which we illustrate through numerous examples. Our improved construction provides a promising avenue for further exploring the potential of quantum computing methods in quantum gravity research.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.