One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States

• URL: http://arxiv.org/abs/2506.14257v1
• Date: Tue, 17 Jun 2025 07:18:46 GMT
• Title: One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States
• Authors: Nyau Fisn, Houren Fu,
• Abstract summary: This note aims to discuss the strategies for computing the local projections on square-lattice cluster states.<n>Although the results in the note are not peer reviewed, we would like to make them public because they are quite easy to check.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing has attracted a lot of attention in recent years. It is one of the promising candidates for the next-generation computing paradigms. Basically, there are two technical lines to realize quantum computing. One is composing the unitary operators of a few qubits to achieve general unitary operators on an arbitrary number of qubits, known as the approach of quantum circuits. The other one focuses on preparing quantum cluster states and performing the computation by measuring the states with a particular basis, known as measurement-based quantum computing or one-way quantum computing. The two strategies have been proven to be equivalent to each other. This note aims to discuss the strategies for computing the local projections on square-lattice cluster states. Seemingly, one strategy for the computation could require both polynomial steps and memories. In particular, if the number of qubits in a square-lattice is denoted by $N$, the step number for computing an arbitrary local projection on the state could be proportional to a polynomial of $N$ under a bounded cost of memory. Consider that the square-lattice cluster states are one kind of universal computing resource, the results might be helpful for understanding the computational advantages of quantum algorithms, as well as the limits of the numerical analysis on other relevant quantum models. Although the results in the note are not peer reviewed, we would like to make them public because they are quite easy to check.

Related papers

• Blind quantum computing with different qudit resource state architectures [0.17188280334580197]
  We show how blind quantum computing generalizes to multi-level quantum systems (qudits)<n>We show that qudit versions of the cluster and brickwork states enable a similar server-blind execution of quantum algorithms.
  arXiv  Detail & Related papers  (2025-10-07T18:00:03Z)
• Quantum-Centric Algorithm for Sample-Based Krylov Diagonalization [0.6512657417859998]
  We introduce a quantum diagonalization algorithm which combines two key ideas on quantum subspaces.<n>We prove that our algorithm converges under working assumptions of Krylov quantum diagonalization and sparseness of ground state.<n>We then show numerical investigations of lattice Hamiltonians, which indicate that our method can outperform existing Krylov quantum diagonalization in presence of shot noise.
  arXiv  Detail & Related papers  (2025-01-16T17:56:19Z)
• Computable and noncomputable in the quantum domain: statements and conjectures [0.70224924046445]
  We consider an approach to the question of describing a class of problems whose solution can be accelerated by a quantum computer. The unitary operation that transforms the initial quantum state into the desired one must be decomposable into a sequence of one- and two-qubit gates.
  arXiv  Detail & Related papers  (2024-03-25T15:47:35Z)
• Towards Distributed Quantum Computing by Qubit and Gate Graph Partitioning Techniques [1.211184870567714]
  We propose two techniques for partitioning large quantum circuits and for distribution to small quantum computers. Our techniques map a quantum circuit to a graph representation. We use the SeQUeNCe quantum communication simulator to measure the time required for generating all the entanglements required to execute the distributed circuit.
  arXiv  Detail & Related papers  (2023-10-05T23:21:18Z)
• Integer Factorization by Quantum Measurements [0.0]
  Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on classical computers. Among the known quantum algorithms, a special role is played by the Shor algorithm, i.e. a quantum-time algorithm for integer factorization. Here we present a different algorithm for integer factorization based on another genuine quantum property: quantum measurement.
  arXiv  Detail & Related papers  (2023-09-19T17:00:01Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Variational Quantum and Quantum-Inspired Clustering [0.0]
  We present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2022-06-20T17:02:19Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Quantum advantage for computations with limited space [6.327095331866255]
  We consider space-restricted computations, where input is a read-only memory and only one (qu)bit can be computed on. We experimentally demonstrate computations of $3$-, $4$-, $5$-, and $6$- by quantum circuits, leveraging custom two-qubit gates.
  arXiv  Detail & Related papers  (2020-08-14T17:31:12Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.