Circuit Knitting for Continuous-Variable Quantum States

• URL: http://arxiv.org/abs/2509.07947v1
• Date: Tue, 09 Sep 2025 17:35:10 GMT
• Title: Circuit Knitting for Continuous-Variable Quantum States
• Authors: Shao-Hua Hu, Ray-Kuang Lee,
• Abstract summary: In finite-dimensional systems, circuit knitting can be used to simulate non-classical quantum operations using a limited set of resources.<n>We develop a general theoretical framework for simulating non-Gaussian states from the given set of available states.<n>We explore several applications of our theory, including simulation of approximate Fock states, GKP state generation, and cat-state amplification.
• Score: 2.635536317968963
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In finite-dimensional systems, circuit knitting can be used to simulate non-classical quantum operations using a limited set of resources. In this work, we extend circuit knitting techniques to infinite-dimensional quantum systems. We develop a general theoretical framework for simulating non-Gaussian states from the given set of available states. Also, we establish fundamental constraints with the no-go theorem on the circuit knitting of multi-mode Gaussian operations, by showing that the exact knitting with separable operations requires infinite sampling overhead. We further explore several applications of our theory, including simulation of approximate Fock states, GKP state generation, and cat-state amplification.

Related papers

• Entanglement-assisted circuit knitting [4.546558096957597]
  entanglement-assisted LOCC and circuit knitting represent two complementary approaches to scalable quantum computation.<n>We propose a hybrid framework that integrates these two paradigms by performing circuit knitting assisted with a limited amount of entanglement.<n>This hybrid approach can be viewed as a form of hybrid classical-quantum computation, balancing the trade-off between sampling and entanglement efficiency.
  arXiv  Detail & Related papers  (2025-10-30T17:58:13Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach [5.193557673127421]
  We present a general framework to calculate the lower bound for simulating a broad class of quantum Markov semigroups. Our framework can be applied to both unital and non-unital quantum dynamics.
  arXiv  Detail & Related papers  (2024-07-22T03:57:41Z)
• Simulating Quantum Circuits by Model Counting [0.0]
  We show for the first time that a strong simulation of universal quantum circuits can be efficiently tackled through weighted model counting. Our work paves the way to apply the existing array of powerful classical reasoning tools to realize efficient quantum circuit compilation.
  arXiv  Detail & Related papers  (2024-03-11T22:40:15Z)
• Convergence of Dynamics on Inductive Systems of Banach Spaces [68.8204255655161]
  Examples are phase transitions in the thermodynamic limit, the emergence of classical mechanics from quantum theory at large action, and continuum quantum field theory arising from renormalization group fixed points. We present a flexible modeling tool for the limit of theories: soft inductive limits constituting a generalization of inductive limits of Banach spaces.
  arXiv  Detail & Related papers  (2023-06-28T09:52:20Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• QuGIT: a numerical toolbox for Gaussian quantum states [0.0]
  QuGIT is a python numerical toolbox based on symplectic methods specialized in efficiently simulating multimode Gaussian states and operations. It provides a wide range of Gaussian operations on arbitrary Gaussian states, including unitaries, partial traces, tensor products, general-dyne measurements, conditional and unconditional dynamics.
  arXiv  Detail & Related papers  (2022-01-17T11:58:14Z)
• Simulating quantum circuits using the multi-scale entanglement renormalization ansatz [0.0]
  We propose a scalable technique for approximate simulations of intermediate-size quantum circuits.<n>We benchmark the proposed technique for brick-wall quantum circuits of up to 243 qubits with various depths up to 20 layers.
  arXiv  Detail & Related papers  (2021-12-28T09:05:01Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• A resource efficient approach for quantum and classical simulations of gauge theories in particle physics [0.0]
  lattice gauge theory (LGT) calculations have been pivotal in our understanding of fundamental interactions. Hamiltonian-based formulations involve infinite-dimensional gauge degrees of freedom that can solely be handled by truncation. We provide a resource-efficient protocol to simulate LGTs with continuous gauge groups in the Hamiltonian formulation.
  arXiv  Detail & Related papers  (2020-06-25T04:10:11Z)

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.