Quantum circuits for the Ising spin networks
- URL: http://arxiv.org/abs/2304.03559v1
- Date: Fri, 7 Apr 2023 09:42:29 GMT
- Title: Quantum circuits for the Ising spin networks
- Authors: Grzegorz Czelusta, Jakub Mielczarek
- Abstract summary: We introduce an improved method for constructing quantum circuits for 4-valent Ising spin networks.
This has practical implications for the implementation of quantum circuits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Redesign Quantum Circuits on Quantum Hardware Device [6.627541720714792]
We present a new architecture which enables one to redesign large-scale quantum circuits on quantum hardware.
For concreteness, we apply this architecture to three crucial applications in circuit optimization, including the equivalence checking of (non-) parameterized circuits.
The feasibility of our approach is demonstrated by the excellent results of these applications, which are implemented both in classical computers and current NISQ hardware.
arXiv Detail & Related papers (2024-12-30T12:05:09Z) - Entanglement distribution based on quantum walk in arbitrary quantum networks [6.37705397840332]
We provide a quantum fractal network based on $d$-dimensional GHZ states.
Compared with the continuous quantum walk on the Sierpinski gasket, the quantum walk on the new fractal network spreads more widely within the same time frame.
Our study can serve as a building block for constructing large and complex quantum networks.
arXiv Detail & Related papers (2024-07-05T08:26:41Z) - Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Diamond-shaped quantum circuit for real-time quantum dynamics in one
dimension [0.0]
We show that quantum many-body states can be universally represented using a quantum circuit comprising multi-qubit gates.
We also evaluate the efficiency of a quantum circuit constructed with two-qubit gates in quench dynamics for the transverse-field Ising model.
Our results reveal that a diamond-shaped quantum circuit, designed to approximate the multi-qubit gate-based quantum circuit, remarkably excels in accurately representing the long-time dynamics of the system.
arXiv Detail & Related papers (2023-11-10T07:07:54Z) - Quantivine: A Visualization Approach for Large-scale Quantum Circuit
Representation and Analysis [31.203764035373677]
We develop Quantivine, an interactive system for exploring and understanding quantum circuits.
A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement.
The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
arXiv Detail & Related papers (2023-07-18T04:51:28Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - The Hintons in your Neural Network: a Quantum Field Theory View of Deep
Learning [84.33745072274942]
We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles.
On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
arXiv Detail & Related papers (2021-03-08T17:24:29Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Quantum simulations of a qubit of space [0.0]
A class of spin networks promising from the perspective of quantum simulations of quantum gravitational systems has been studied.
In this article, construction of quantum circuits for a general intertwiner qubit is presented.
The obtained circuits are simulated on 5-qubit (Yorktown) and 15-qubit (Melbourne) IBM superconducting quantum computers.
arXiv Detail & Related papers (2020-03-29T19:53:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.