Entanglement in Higher-Radix Quantum Systems

@article{Smith2019EntanglementIH,
  title={Entanglement in Higher-Radix Quantum Systems},
  author={Kaitlin N. Smith and Mitchell A. Thornton},
  journal={2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)},
  year={2019},
  pages={114-119}
}
  • Kaitlin N. Smith, M. Thornton
  • Published 1 May 2019
  • Physics, Computer Science
  • 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)
Entanglement is an important phenomenon that enables quantum information processing algorithms and quantum communications protocols. Although entangled quantum states are often described in radix-2, higher-radix qudits can become entangled as well. In this work, we both introduce partial entanglement, a concept that does not exist for radix-2 quantum systems, and differentiate between partial and maximal entanglement within non-binary quantum information processing systems. We also develop and… 

Figures and Tables from this paper

Entangled State Preparation for Non-Binary Quantum Computing
TLDR
This work provides background describing the feasibility of multiple-valued logic quantum systems and describes a new systematic method for generating maximally entangled states in quantum systems of dimension greater than two.
Technology-dependent Quantum Logic Synthesis and Compilation

References

SHOWING 1-10 OF 10 REFERENCES
A Radix-4 Chrestenson Gate for Optical Quantum Computation
A recently developed four-port directional coupler used in optical signal processing applications is shown to be equivalent to a radix-4 Chrestenson operator, or gate, in quantum information
Scaling and Better Approximating Quantum Fourier Transform by Higher Radices
TLDR
This work considers extending the reach of the realistic quantum systems by building a QFT over ternary quantum digits by improving approximation properties and increases the state space by a factor of (q/2)n.
Satellite-based entanglement distribution over 1200 kilometers
TLDR
Satellite-based distribution of entangled photon pairs to two locations separated by 1203 kilometers on Earth, through two satellite-to-ground downlinks is demonstrated, with a survival of two-photon entanglement and a violation of Bell inequality.
Maximally Entangled Multipartite States: A Brief Survey
The problem of identifying maximally entangled quantum states of a composite quantum systems is analyzed. We review some states of multipartite systems distinguished with respect to certain measures
Algorithms for quantum computation: discrete logarithms and factoring
  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
TLDR
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
The role of super-fast transforms in speeding up quantum computations
  • Z. Zilic, K. Radecka
  • Computer Science, Physics
    Proceedings 32nd IEEE International Symposium on Multiple-Valued Logic
  • 2002
TLDR
The role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor are presented and quantum Fourier transform is derived over non-binary quantum digits using the Chrestenson gate.
A fast quantum mechanical algorithm for database search
TLDR
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Quantum Logic Implementation of Unary Arithmetic Operations
TLDR
It is shown that the inheritance principle in conjunction with the bijective nature of many unary functions is used to realize compact quantum logic cascades that require no ancilla digits and generate no garbage outputs.
A class of complete orthogonal systems
A class of generalized Walsh functions