Quantum gates from the middle convolution of twisted Burau representations

arXiv:2610.00293v1 Announce Type: new Abstract: We study braid representations obtained from character-twisted Burau inputs by the Katz-Long-Moody (KLM) construction, which corresponds to multiplicative middle convolution for KZ-type equations. For $n\ge2$, let $q=e^{2\pi ia}$, $\tau=e^{2\pi ic}$, where $a,c>0$ and $nc+(n+1)a<1$. Known form and signature results give a positive-definite invariant form for $\lambda=e^{2\pi il}$, $0<l<1-nc-(n+1)a$. For fixed input, unitary realizations are unique up to simultaneous unitary conjugation. We address two questions. First, we determine spectra and invariant summands of the $M=n(n+1)$-dimensional output. The generator spectrum recovers $(q,\tau)$. The output decomposes into two trivial and two reduced Burau summands, and an $n(n-1)$-dimensional summand isomorphic to Long's reduced construction, generically irreducible for $n=3,4$. If $a$ or $c$ is irrational, every generator is non-Clifford in every finite-dimensional Weyl-Heisenberg frame; if $1,a,c$ are linearly independent over $\mathbb{Q}$, every generator is entangling for every nontrivial bipartition. The full braid image is not projectively dense. For general positive-definite unitary inputs, irreducibility of the full braid output at a nonexceptional parameter forces the free-group input operators to commute. Second, we construct one orthonormal basis giving each generator one block of size $2(n+1)$, $n-2$ blocks of size two, and identity elsewhere. Each generator is a product of $2n$ rank-one phase reflections and, in a fixed binary encoding, an $O(M)$-length word in one-qubit unitaries and CNOTs, without auxiliary qubits and including direction preparation and its inverse. We give finite-alphabet approximation, conditioning and error bounds, and a matched-resource comparison with a Quantum Shannon reference compiler. The gate bound is exponential in the encoded qubit count and excludes classical preprocessing.

Abstract:We study braid representations obtained from character-twisted Burau inputs by the Katz-Long-Moody (KLM) construction, which corresponds to multiplicative middle convolution for KZ-type equations. For $n\ge2$, let $q=e^{2\pi ia}$, $\tau=e^{2\pi ic}$, where $a,c>0$ and $nc+(n+1)a<1$. Known form and signature results give a positive-definite invariant form for $\lambda=e^{2\pi il}$, $0<l<1-nc-(n+1)a$. For fixed input, unitary realizations are unique up to simultaneous unitary conjugation. We address two questions. First, we determine spectra and invariant summands of the $M=n(n+1)$-dimensional output. The generator spectrum recovers $(q,\tau)$. The output decomposes into two trivial and two reduced Burau summands, and an $n(n-1)$-dimensional summand isomorphic to Long's reduced construction, generically irreducible for $n=3,4$. If $a$ or $c$ is irrational, every generator is non-Clifford in every finite-dimensional Weyl-Heisenberg frame; if $1,a,c$ are linearly independent over $\mathbb{Q}$, every generator is entangling for every nontrivial bipartition. The full braid image is not projectively dense. For general positive-definite unitary inputs, irreducibility of the full braid output at a nonexceptional parameter forces the free-group input operators to commute. Second, we construct one orthonormal basis giving each generator one block of size $2(n+1)$, $n-2$ blocks of size two, and identity elsewhere. Each generator is a product of $2n$ rank-one phase reflections and, in a fixed binary encoding, an $O(M)$-length word in one-qubit unitaries and CNOTs, without auxiliary qubits and including direction preparation and its inverse. We give finite-alphabet approximation, conditioning and error bounds, and a matched-resource comparison with a Quantum Shannon reference compiler. The gate bound is exponential in the encoded qubit count and excludes classical preprocessing.

Quantum Physics (quant-ph); Mathematical Physics (math-ph); Representation Theory (math.RT)

arXiv:2610.00293 [quant-ph]

(or arXiv:2610.00293v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2610.00293 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

certificate_locus_checks.json

certificate_locus_checks.py

charpoly_and_relations.py

commutant_numerics.py

direct_invariance/README.md

direct_invariance/verify_braid_form_identity.py

error_margins/results/diagnostics.json

error_margins/verify_error_margins.py

exact_commutant.json

exact_commutant.py

fixed_encoding_checks.json

fixed_encoding_checks.py

jones_jordan_scan.py

matched_benchmark/README_JA.md

matched_benchmark/check_endpoint_rates.py

matched_benchmark/reference_compilers.py

matched_benchmark/requirements.txt

matched_benchmark/results/H.npy

matched_benchmark/results/S.npy

matched_benchmark/results/alternative_n4_i1_qsd_reference.json

matched_benchmark/results/alternative_n4_i1_result.json

matched_benchmark/results/alternative_n4_i1_structured.json

matched_benchmark/results/alternative_n4_i2_qsd_reference.json

matched_benchmark/results/alternative_n4_i2_result.json

matched_benchmark/results/alternative_n4_i2_structured.json

matched_benchmark/results/alternative_n4_i3_qsd_reference.json

matched_benchmark/results/alternative_n4_i3_result.json

matched_benchmark/results/alternative_n4_i3_structured.json

matched_benchmark/results/benchmark.json

matched_benchmark/results/benchmark_summary.csv

matched_benchmark/results/coincident_n4_i1_qsd_reference.json

matched_benchmark/results/coincident_n4_i1_result.json

matched_benchmark/results/coincident_n4_i1_structured.json

matched_benchmark/results/coincident_n4_i2_qsd_reference.json

matched_benchmark/results/coincident_n4_i2_result.json

matched_benchmark/results/coincident_n4_i2_structured.json

matched_benchmark/results/coincident_n4_i3_qsd_reference.json

matched_benchmark/results/coincident_n4_i3_result.json

matched_benchmark/results/coincident_n4_i3_structured.json

matched_benchmark/results/endpoint_checks.json

matched_benchmark/results/environment.json

matched_benchmark/results/main_n2_i1_qsd_reference.json

matched_benchmark/results/main_n2_i1_result.json

matched_benchmark/results/main_n2_i1_structured.json

matched_benchmark/results/main_n3_i1_qsd_reference.json

matched_benchmark/results/main_n3_i1_result.json

matched_benchmark/results/main_n3_i1_structured.json

matched_benchmark/results/main_n3_i2_qsd_reference.json

matched_benchmark/results/main_n3_i2_result.json

matched_benchmark/results/main_n3_i2_structured.json

matched_benchmark/results/main_n4_i1_qsd_reference.json

matched_benchmark/results/main_n4_i1_result.json

matched_benchmark/results/main_n4_i1_structured.json

matched_benchmark/results/main_n4_i2_qsd_reference.json

matched_benchmark/results/main_n4_i2_result.json

matched_benchmark/results/main_n4_i2_structured.json

matched_benchmark/results/main_n4_i3_qsd_reference.json

matched_benchmark/results/main_n4_i3_result.json

matched_benchmark/results/main_n4_i3_structured.json

matched_benchmark/results/main_n5_i1_qsd_reference.json

matched_benchmark/results/main_n5_i1_result.json

matched_benchmark/results/main_n5_i1_structured.json

matched_benchmark/results/main_n5_i2_qsd_reference.json

matched_benchmark/results/main_n5_i2_result.json

matched_benchmark/results/main_n5_i2_structured.json

matched_benchmark/results/main_n5_i3_qsd_reference.json

matched_benchmark/results/main_n5_i3_result.json

matched_benchmark/results/main_n5_i3_structured.json

matched_benchmark/results/main_n5_i4_qsd_reference.json

matched_benchmark/results/main_n5_i4_result.json

matched_benchmark/results/main_n5_i4_structured.json

matched_benchmark/results/main_n6_i1_qsd_reference.json

matched_benchmark/results/main_n6_i1_result.json

matched_benchmark/results/main_n6_i1_structured.json

matched_benchmark/results/main_n6_i2_qsd_reference.json

matched_benchmark/results/main_n6_i2_result.json

matched_benchmark/results/main_n6_i2_structured.json

matched_benchmark/results/main_n6_i3_qsd_reference.json

matched_benchmark/results/main_n6_i3_result.json

matched_benchmark/results/main_n6_i3_structured.json

matched_benchmark/results/main_n6_i4_qsd_reference.json

matched_benchmark/results/main_n6_i4_result.json

matched_benchmark/results/main_n6_i4_structured.json

matched_benchmark/results/main_n6_i5_qsd_reference.json

matched_benchmark/results/main_n6_i5_result.json

matched_benchmark/results/main_n6_i5_structured.json

matched_benchmark/results/main_n8_i1_qsd_reference.json

matched_benchmark/results/main_n8_i1_result.json

matched_benchmark/results/main_n8_i1_structured.json

matched_benchmark/results/main_n8_i4_qsd_reference.json

matched_benchmark/results/main_n8_i4_result.json

matched_benchmark/results/main_n8_i4_structured.json

matched_benchmark/results/main_n8_i7_qsd_reference.json

matched_benchmark/results/main_n8_i7_result.json

matched_benchmark/results/main_n8_i7_structured.json

matched_benchmark/results/target.npy

matched_benchmark/results/unitary.npy

matched_benchmark/results/valid.npy

matched_benchmark/run_matched_benchmark.py

matched_benchmark/run_qiskit_optional.py

matched_benchmark/selftests.json

reflection_synthesis/results/H.npy

reflection_synthesis/results/S.npy

reflection_synthesis/results/U.npy

reflection_synthesis/results/a.npy

reflection_synthesis/results/c.npy

reflection_synthesis/results/l.npy

reflection_synthesis/results/n.npy

reflection_synthesis/results/n2_generator1.qasm

reflection_synthesis/results/n3_generator1.qasm

reflection_synthesis/results/n3_generator2.qasm

reflection_synthesis/results/n4_generator1.qasm

reflection_synthesis/results/n4_generator2.qasm

reflection_synthesis/results/n4_generator3.qasm

reflection_synthesis/results/phases.npy

reflection_synthesis/results/reflection_vectors.npy

reflection_synthesis/results/verification_results.json

reflection_synthesis/verify_reflection_cost.py

requirements.txt

twisted_burau_checks.py

verify_klm_v2.py

(119 additional files not shown) You must enabled JavaScript to view entire file list.

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

analiza aiqbench

Quantum gates from the middle convolution of twisted Burau representations

Subiecte conexe