Finite-Function-Encoding Quantum States
arXiv:2012.00490 · doi:10.22331/q-2022-05-09-708
Abstract
We introduce finite-function-encoding (FFE) states which encode arbitrary -valued logic functions, i.e., multivariate functions over the ring of integers modulo , and investigate some of their structural properties. We also point out some differences between polynomial and non-polynomial function encoding states: The former can be associated to graphical objects, that we dub tensor-edge hypergraphs (TEH), which are a generalization of hypergraphs with a tensor attached to each hyperedge encoding the coefficients of the different monomials. To complete the framework, we also introduce a notion of finite-function-encoding Pauli (FP) operators, which correspond to elements of what is known as the generalized symmetric group in mathematics. First, using this machinery, we study the stabilizer group associated to FFE states and observe how qudit hypergraph states introduced in arXiv:1612.06418v2 admit stabilizers of a particularly simpler form. Afterwards, we investigate the classification of FFE states under local unitaries (LU), and, after showing the complexity of this problem, we focus on the case of bipartite states and especially on the classification under local FP operations (LFP). We find all LU and LFP classes for two qutrits and two ququarts and study several other special classes, pointing out the relation between maximally entangled FFE states and complex Butson-type Hadamard matrices. Our investigation showcases also the relation between the properties of FFE states, especially their LU classification, and the theory of finite rings over the integers.
arXiv commentComments welcome
References in corpus (46)
- Measurement-based quantum computation with cluster states
- Security of quantum key distribution using d-level systems
- Multi-party entanglement in graph states
- Qudits and high-dimensional quantum computing
- High-dimensional quantum communication: benefits, progress, and future challenges
- Optimal eavesdropping in cryptography with three-dimensional quantum states
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Provably-Secure and High-Rate Quantum Key Distribution with Time-Bin Qudits
- Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
- Most quantum states are too entangled to be useful as computational resources
- Overcoming Noise in Entanglement Distribution
- Quantifying entanglement resources
- Enhanced fault-tolerant quantum computing in -level systems
- Quantum Hypergraph States
- Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices
- Quantum secret sharing with qudit graph states
- Genuinely multipartite entangled states and orthogonal arrays
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Absolutely maximally entangled states of seven qubits do not exist
- Many-body quantum magic
- Quantifying photonic high-dimensional entanglement
- Quantum Error Correcting Codes Using Qudit Graph States
- Weak randomness in device independent quantum key distribution and the advantage of using high dimensional entanglement
- Multipartite entanglement in quantum algorithms
- Entanglement and quantum combinatorial designs
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Quantum key distribution overcoming extreme noise: simultaneous subspace coding using high-dimensional entanglement
- Entanglement and nonclassical properties of hypergraph states
- Pathways for entanglement based quantum communication in the face of high noise
- Encoding Hypergraphs into Quantum States
- Local unitary versus local Clifford equivalence of stabilizer states
- A fast fault-tolerant decoder for qubit and qudit surface codes
- Extreme violation of local realism in quantum hypergraph states
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- Constructions of k-uniform and absolutely maximally entangled states beyond maximum distance codes
- Complex Hadamard matrices of order 6: a four-parameter family
- Local unitary symmetries of hypergraph states
- Qudit Hypergraph States
- The LU-LC conjecture is false
- Minimum orbit dimension for local unitary action on n-qubit pure states
- A quantum compiler for qudits of prime dimension greater than 3
- The stabilizer dimension of graph states
- A Boolean Functions Theoretic Approach to Quantum Hypergraph States and Entanglement
- Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements
- The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2)