Connecting quantum circuit amplitudes and matrix permanents through polynomials
- URL: http://arxiv.org/abs/2408.08857v1
- Date: Fri, 16 Aug 2024 17:39:55 GMT
- Title: Connecting quantum circuit amplitudes and matrix permanents through polynomials
- Authors: Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher,
- Abstract summary: We strengthen the connection between qubit-based quantum circuits and photonic quantum computation.
This connection allows one to express quantum amplitudes arising from qubit-based circuits as permanents, which can naturally be estimated on a photonic quantum device.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we strengthen the connection between qubit-based quantum circuits and photonic quantum computation. Within the framework of circuit-based quantum computation, the sum-over-paths interpretation of quantum probability amplitudes leads to the emergence of sums of exponentiated polynomials. In contrast, the matrix permanent is a combinatorial object that plays a crucial role in photonic by describing the probability amplitudes of linear optical computations. To connect the two, we introduce a general method to encode an $\mathbb F_2$-valued polynomial with complex coefficients into a graph, such that the permanent of the resulting graph's adjacency matrix corresponds directly to the amplitude associated the polynomial in the sum-over-path framework. This connection allows one to express quantum amplitudes arising from qubit-based circuits as permanents, which can naturally be estimated on a photonic quantum device.
Related papers
- Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum.
We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
arXiv Detail & Related papers (2024-10-28T08:43:40Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Quantum state tomography of photon's polarization and path degrees of
freedom [0.0]
We propose a method to reconstruct the density matrix of two qubits encoded in the polarization and path degrees of freedom of a single photon.
Our findings put forward photonic circuits for the investigation of the dynamics of open quantum systems.
arXiv Detail & Related papers (2023-08-24T14:17:57Z) - Discrete dynamics in the set of quantum measurements [0.0]
A quantum measurement, often referred to as positive operator-valued measurement (POVM), is a set of positive operators $P_i=P_idaggeq 0$ summing to identity.
We analyze dynamics induced by blockwise bistochastic matrices, in which both columns and rows sum to the identity.
arXiv Detail & Related papers (2023-08-10T19:34:04Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Order-invariant two-photon quantum correlations in PT-symmetric
interferometers [62.997667081978825]
Multiphoton correlations in linear photonic quantum networks are governed by matrix permanents.
We show that the overall multiphoton behavior of a network from its individual building blocks typically defies intuition.
Our results underline new ways in which quantum correlations may be preserved in counterintuitive ways even in small-scale non-Hermitian networks.
arXiv Detail & Related papers (2023-02-23T09:43:49Z) - Classical-to-quantum transition in multimode nonlinear systems with
strong photon-photon coupling [12.067269037074292]
We investigate the classical-to-quantum transition of such photonic nonlinear systems using the quantum cluster-expansion method.
This work presents a universal tool to study quantum dynamics of multimode systems and explore the nonlinear photonic devices for continuous-variable quantum information processing.
arXiv Detail & Related papers (2021-11-18T07:26:57Z) - Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron
Correlation [58.720142291102135]
We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer.
We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
arXiv Detail & Related papers (2021-06-22T18:00:00Z) - Exploring complex graphs using three-dimensional quantum walks of
correlated photons [52.77024349608834]
We introduce a new paradigm for the direct experimental realization of excitation dynamics associated with three-dimensional networks.
This novel testbed for the experimental exploration of multi-particle quantum walks on complex, highly connected graphs paves the way towards exploiting the applicative potential of fermionic dynamics in integrated quantum photonics.
arXiv Detail & Related papers (2020-07-10T09:15:44Z) - Pseudo-dimension of quantum circuits [0.0]
We prove pseudo-dimension bounds on the output probability of quantum circuits.
We show that circuits of known size and depth are PAC-learnable.
arXiv Detail & Related papers (2020-02-04T19:00:13Z)
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.