English
Related papers

Related papers: Quantum advantage using high-dimensional twisted p…

200 papers

{\it Learning finite automata} (termed as {\it model learning}) has become an important field in machine learning and has been useful realistic applications. Quantum finite automata (QFA) are simple models of quantum computers with finite…

Quantum Physics · Physics 2023-11-14 Daowen Qiu

Optical networks implementing single-qudit quantum computation gates may exhibit superior properties to those for qubits as each of the optical elements in the network can work in parallel on many optical modes simultaneously. We present an…

Quantum Physics · Physics 2020-11-17 Jaroslav Kysela , Xiaoqin Gao , Borivoje Dakić

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a…

Formal Languages and Automata Theory · Computer Science 2014-06-17 A. C. Cem Say , Abuzer Yakaryilmaz

We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a large probability (over 0.98), then the power of 1-way QFAs…

Quantum Physics · Physics 2007-05-23 A. Ambainis , R. Freivalds

High-dimensional quantum systems offer many advantages over low-dimensional quantum systems. Meanwhile, unitary transformations on quantum states are important parts in various quantum information tasks, whereas they become technically…

Quantum Physics · Physics 2023-05-10 Dong-Xu Chen , Yunlong Wang , Feiran Wang , Jun-Long Zhao , Chui-Ping Yang

We study 1-way quantum finite automata (QFAs) and compare them with their classical counterparts. We show that 1-way QFAs can be very space efficient. We construct a 1-way QFAs that are quadratically smaller than any equivalent…

Quantum Physics · Physics 2007-05-23 Arnolds Kikusts

In automata theory, the quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to the QFAs augmented with counters or stacks. Moreover, to our…

Computational Complexity · Computer Science 2011-05-10 Abuzer Yakaryilmaz

Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…

Quantum Physics · Physics 2009-11-10 Yaakov S. Weinstein , C. Stephen Hellberg

In the literature, there exist several quantum finite automata (QFA) models with both quantum and classical states. These models are of particular interest,as they show praiseworthy advantages over the fully quantum models in some…

Formal Languages and Automata Theory · Computer Science 2015-06-30 Lvzhou Li , Yuan Feng

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…

Formal Languages and Automata Theory · Computer Science 2018-07-05 Andris Ambainis , Abuzer Yakaryılmaz

We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it…

Formal Languages and Automata Theory · Computer Science 2016-06-07 Alejandro Díaz-Caro , Abuzer Yakaryılmaz

Quantum entanglement shared between more than two particles is essential to foundational questions in quantum mechanics, and upcoming quantum information technologies. So far, up to 14 two-dimensional qubits have been entangled, and an open…

Quantum Physics · Physics 2016-02-18 B. C. Hiesmayr , M. J. A. de Dood , W. Löffler

Quantum key distributions (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information that can be sent per photon and placing tight bounds on the error that such a system can tolerate. Here we…

A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…

Computation and Language · Computer Science 2024-07-04 SeungYeop Baik , Sicheol Sung , Yo-Sub Han

High-dimensional encoding of quantum information holds the potential to greatly increase the computational power of existing devices by enlarging the accessible state space for fixed register size and by reducing the number of required…

High-dimensional broadband quantum memory significantly expands quantum information processing capabilities, but the memory efficiency becomes insufficient when extended to high dimensions. We demonstrate an efficient quantum memory for…

Quantum Physics · Physics 2025-09-03 Zeliang Wu , Jinxian Guo , Zhifei Yu , Wenfeng Huang , Chun-Hua Yuan , Weiping Zhang , L. Q. Chen

Photons with a twisted phase front carry a quantized amount of orbital angular momentum (OAM) and have become important in various fields of optics, such as quantum and classical information science or optical tweezers. Because no upper…

Quantum Physics · Physics 2016-11-21 Robert Fickler , Geoff T. Campbell , Ben C. Buchler , Ping Koy Lam , Anton Zeilinger

Quantum memory plays a pivotal role in the construction of quantum repeaters, which are essential devices for establishing long-distance quantum communications and large-scale quantum networks. To boost information capacity and signal…

Among the optical degrees of freedom, the orbital angular momentum of light provides unique properties, including mechanical torque action with applications for light manipulation, enhanced sensitivity in imaging techniques and potential…

Quantum Physics · Physics 2014-03-03 A. Nicolas , L. Veissier , L. Giner , E. Giacobino , D. Maxein , J. Laurat

Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A.…

Quantum Physics · Physics 2007-05-23 M. V. Panduranga Rao , V. Vinay
‹ Prev 1 2 3 10 Next ›