• Corpus ID: 220666089

Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX Calculus

@article{Bishwas2020PartsOS,
  title={Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX Calculus},
  author={Arit Kumar Bishwas and Ashish Mani and Vasile Palade},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.10328}
}
This paper proposes an optimized formulation of the parts of speech tagging in Natural Language Processing with a quantum computing approach and further demonstrates the quantum gate-level runnable optimization with ZX-calculus, keeping the implementation target in the context of Noisy Intermediate Scale Quantum Systems (NISQ). Our quantum formulation exhibits quadratic speed up over the classical counterpart and further demonstrates the implementable optimization with the help of ZX calculus… 

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Quantum Computing in the NISQ era and beyond
TLDR
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
The history of machine translation in a nutshell
It is possible to trace ideas about mechanizing translation processes back to the seventeenth century, but realistic possibilities came only in the 20th century. In the mid 1930s, a French-Armenian
Quantum supremacy using a programmable superconducting processor
TLDR
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
Interacting Quantum Observables: Categorical Algebra and Diagrammatics
TLDR
The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.
Demonstration of the QCCD trapped-ion quantum computer architecture
We report on the integration of all necessary ingredients of the trapped-ion QCCD (quantum charge-coupled device) architecture into a robust, fully-connected, and programmable trapped-ion quantum
Big data classification with quantum multiclass SVM and quantum one-against-all approach
TLDR
The proposed approach demonstrates that the big data multiclass classification can be implemented with quantum multiclass support vector machine in logarithmic time complexity on a quantum computer, compared to the classical multiclassSupport vector machines that can be implement with polynomial time complexity.
Three qubits can be entangled in two inequivalent ways
Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single
PARTS-OF-SPEECH TAGGING:
A Quantum Algorithm for Finding the Minimum
TLDR
A simple quantum algorithm whicholves the minimum searching problem using O(√N) probes using the mainsubroutine of Grover’s recent quantum searching algorithm.
...
...