Статті в журналах: "Programmable quantum computer"

1

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. PT. III. Quantum software engineering – quantum approximate optimization algorithm on small quantum processors." System Analysis in Science and Education, no. 2 (2020) (June 30, 2020): 115–76. http://dx.doi.org/10.37005/2071-9612-2020-2-115-176.

Повний текст джерела

Анотація:

Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Wilkins, Alex. "First fully programmable atom-based quantum computer." New Scientist 253, no. 3370 (January 2022): 9. http://dx.doi.org/10.1016/s0262-4079(22)00078-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Madsen, Lars S., Fabian Laudenbach, Mohsen Falamarzi Askarani, Fabien Rortais, Trevor Vincent, Jacob F. F. Bulmer, Filippo M. Miatto, et al. "Quantum computational advantage with a programmable photonic processor." Nature 606, no. 7912 (June 1, 2022): 75–81. http://dx.doi.org/10.1038/s41586-022-04725-x.

Повний текст джерела

Анотація:

AbstractA quantum computer attains computational advantage when outperforming the best classical computers running the best-known algorithms on well-defined tasks. No photonic machine offering programmability over all its quantum gates has demonstrated quantum computational advantage: previous machines1,2 were largely restricted to static gate sequences. Earlier photonic demonstrations were also vulnerable to spoofing3, in which classical heuristics produce samples, without direct simulation, lying closer to the ideal distribution than do samples from the quantum hardware. Here we report quantum computational advantage using Borealis, a photonic processor offering dynamic programmability on all gates implemented. We carry out Gaussian boson sampling4 (GBS) on 216 squeezed modes entangled with three-dimensional connectivity5, using a time-multiplexed and photon-number-resolving architecture. On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution, whereas Borealis requires only 36 μs. This runtime advantage is over 50 million times as extreme as that reported from earlier photonic machines. Ours constitutes a very large GBS experiment, registering events with up to 219 photons and a mean photon number of 125. This work is a critical milestone on the path to a practical quantum computer, validating key technological features of photonics as a platform for this goal.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Bužek, Vladimír, Mark Hillery, Mário Ziman, and Marián Roško. "Programmable Quantum Processors." Quantum Information Processing 5, no. 5 (July 12, 2006): 313–420. http://dx.doi.org/10.1007/s11128-006-0028-z.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Sousa, P. B. M., and R. V. Ramos. "Universal quantum circuit for n-qubit quantum gate: a programmable quantum gate." Quantum Information and Computation 7, no. 3 (March 2007): 228–42. http://dx.doi.org/10.26421/qic7.3-4.

Повний текст джерела

Анотація:

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a different direction. We propose a general quantum circuit able to implement any specific quantum circuit by just setting correctly the parameters. In other words, we propose a programmable quantum circuit. This opens the possibility to construct a real quantum computer where several different quantum operations can be realized in the same hardware. The configuration is proposed and its optical implementation is discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Kim, Jaehyun, Jae-Seung Lee, Taesoon Hwang, and Soonchil Lee. "Experimental demonstration of a programmable quantum computer by NMR." Journal of Magnetic Resonance 166, no. 1 (January 2004): 35–38. http://dx.doi.org/10.1016/j.jmr.2003.10.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

La Cour, Brian R., Corey I. Ostrove, Granville E. Ott, Michael J. Starkey, and Gary R. Wilson. "Classical emulation of a quantum computer." International Journal of Quantum Information 14, no. 04 (June 2016): 1640004. http://dx.doi.org/10.1142/s0219749916400049.

Повний текст джерела

Анотація:

This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g. acoustic, electromagnetic, etc.) but this paper will focus on electronic signals. Individual qubits are represented by in-phase and quadrature sinusoidal signals, while unitary gate operations are performed using simple analog electronic circuit devices. In this manner, the Hilbert space structure of a multi-qubit quantum state, as well as a universal set of gate operations, may be fully emulated classically. Results from a programmable prototype system are presented and discussed.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Debnath, S., N. M. Linke, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe. "Demonstration of a small programmable quantum computer with atomic qubits." Nature 536, no. 7614 (August 2016): 63–66. http://dx.doi.org/10.1038/nature18648.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. Pt. I:Quantum software engineering–quantum gate level applied models simulators." System Analysis in Science and Education, no. 1 (2020) (2020): 52–84. http://dx.doi.org/10.37005/2071-9612-2020-1-52-84.

Повний текст джерела

Анотація:

Principles and methodologies of quantum algorithmic gates design for master course and PhD students in computer science, control engineering and intelligent robotics described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. Applications of quantum gate of nanotechnology in intelligent quantum control introduced. Anew approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. The main attention focused on the development of design method of fast quantum algorithm operators as superposition, entanglement and interference, which are in general time-consuming operations due to the number of products that have performed. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described. As example, the method for performing Grover’s interference operator without product operations introduced. The background of developed information technology is the "Quantum / Soft Computing Optimizer" (QSCOptKBTM) SW based on soft and quantum computational intelligence toolkit.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Melnyk, Oleksandr, and Viktoriia Kozarevych. "SIMULATION OF PROGRAMMABLE SINGLE-ELECTRON NANOCIRCUITS." Bulletin of the National Technical University "KhPI". Series: Mathematical modeling in engineering and technologies, no. 1 (March 5, 2021): 64–68. http://dx.doi.org/10.20998/2222-0631.2020.01.05.

Повний текст джерела

Анотація:

The speed and specializations of large-scale integrated circuits always contradict their versatility, which expands their range and causes the rise in price of electronic devices. It is possible to eliminate the contradictions between universality and specialization by developing programmable nanoelectronic devices, the algorithms of which are changed at the request of computer hardware developers, i.e. by creating arithmetic circuits with programmable characteristics. The development of issues of theory and practice of the majority principle is now an urgent problem, since the nanoelectronic execution of computer systems with programmable structures will significantly reduce their cost and significantly simplify the design stage of automated systems. Today there is an important problem of developing principles for building reliable computer equipment. The use of mathematical and circuit modeling along with computer-aided design systems (CAD) can significantly increase the reliability of the designed devices. The authors prove the advantages of creating programmable nanodevices to overcome the physical limitations of micro-rominiatization. This continuity contributes to the accelerated introduction of mathematical modeling based on programmable nanoelectronics devices. The simulation and computer-aided design of reliable programmable nanoelectronic devices based on the technology of quantum automata is described. While constructing single-electron nanocircuits of combinational and sequential types the theory of majority logic is used. The order of construction and programming of various types of arithmetic-logic units is analyzed.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Ren, Wenhui, Weikang Li, Shibo Xu, Ke Wang, Wenjie Jiang, Feitong Jin, Xuhao Zhu, et al. "Experimental quantum adversarial learning with programmable superconducting qubits." Nature Computational Science 2, no. 11 (November 28, 2022): 711–17. http://dx.doi.org/10.1038/s43588-022-00351-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Kalogeiton, Vicky S., Dim P. Papadopoulos, Orestis Liolis, Vassilios A. Mardiris, Georgios Ch Sirakoulis, and Ioannis G. Karafyllidis. "Programmable Crossbar Quantum-Dot Cellular Automata Circuits." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 36, no. 8 (August 2017): 1367–80. http://dx.doi.org/10.1109/tcad.2016.2618869.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Siomau, Michael. "Undecidable, Unrecognizable, and Quantum Computing." Quantum Reports 2, no. 3 (July 1, 2020): 337–42. http://dx.doi.org/10.3390/quantum2030023.

Повний текст джерела

Анотація:

Quantum computing allows us to solve some problems much faster than existing classical algorithms. Yet, the quantum computer has been believed to be no more powerful than the most general computing model—the Turing machine. Undecidable problems, such as the halting problem, and unrecognizable inputs, such as the real numbers, are beyond the theoretical limit of the Turing machine. I suggest a model for a quantum computer, which is less general than the Turing machine, but may solve the halting problem for any task programmable on it. Moreover, inputs unrecognizable by the Turing machine can be recognized by the model, thus breaking the theoretical limit for a computational task. A quantum computer is not just a successful design of the Turing machine as it is widely perceived now, but is a different, less general but more powerful model for computing, the practical realization of which may need different strategies than those in use now.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Ayoade, Olawale, Pablo Rivas, and Javier Orduz. "Artificial Intelligence Computing at the Quantum Level." Data 7, no. 3 (February 25, 2022): 28. http://dx.doi.org/10.3390/data7030028.

Повний текст джерела

Анотація:

The extraordinary advance in quantum computation leads us to believe that, in the not-too-distant future, quantum systems will surpass classical systems. Moreover, the field’s rapid growth has resulted in the development of many critical tools, including programmable machines (quantum computers) that execute quantum algorithms and the burgeoning field of quantum machine learning, which investigates the possibility of faster computation than traditional machine learning. In this paper, we provide a thorough examination of quantum computing from the perspective of a physicist. The purpose is to give laypeople and scientists a broad but in-depth understanding of the area. We also recommend charts that summarize the field’s diversions to put the whole field into context.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Goto, Hayato, Kosuke Tatsumura, and Alexander R. Dixon. "Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems." Science Advances 5, no. 4 (April 2019): eaav2372. http://dx.doi.org/10.1126/sciadv.aav2372.

Повний текст джерела

Анотація:

Combinatorial optimization problems are ubiquitous but difficult to solve. Hardware devices for these problems have recently been developed by various approaches, including quantum computers. Inspired by recently proposed quantum adiabatic optimization using a nonlinear oscillator network, we propose a new optimization algorithm simulating adiabatic evolutions of classical nonlinear Hamiltonian systems exhibiting bifurcation phenomena, which we call simulated bifurcation (SB). SB is based on adiabatic and chaotic (ergodic) evolutions of nonlinear Hamiltonian systems. SB is also suitable for parallel computing because of its simultaneous updating. Implementing SB with a field-programmable gate array, we demonstrate that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine. SB will accelerate large-scale combinatorial optimization harnessing digital computer technologies and also offer a new application of computational and mathematical physics.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Hlukhov, Valeriy S. "RESEARCH OF DIGITAL QUBITES FOR HETEROGENEOUS DIGITAL QUANTUM COPROCESSORS." Applied Aspects of Information Technology 4, no. 1 (April 10, 2021): 91–99. http://dx.doi.org/10.15276/aait.01.2021.8.

Повний текст джерела

Анотація:

Recently, interest is growing towards real quantum computers, which are analog and probabilistic devices by nature. The interest is also growing to their digital version, both software and hardware. One approach to the construction of real quantum computers is to use quantum chips. The hardware implementation of digital quantum computers involves the use of field programmable gate arrays. A digital quantum coprocessor has already been created which has over a thousand digital qubits and can perform such complex algorithms as a quantum Fourier transformation. The created and working digital quantum coprocessor can already be used to work out various quantum algorithms, algorithms for the interaction of a classic computer and its quantum coprocessor, as well as for research various options for building digital qubits. The purpose of this work is to study the effect of the accuracy of the presentation of the state of digital qubit on the probability of obtaining the correct results of the digital quantum coprocessor. For the study, a heterogeneous digital quantum coprocessor with thirty two digital qubits is selected, which will perform the Fourier quantum transformation. The article describes the basics of building digital quantum coprocessors. Schemes that illustrate the interaction of a classic computer and a quantum coprocessor, the architecture of the coprocessor and the possible structures of its digital qubits are given. Two variants of the coprocessor, homogeneous one with one pseudo-random codes generator and one comparator, and heterogeneous one, with a generator and a comparator in each digital quantum cell, from which digital qubits consist, are shown. Two options for comparators are also shown - with a direct functional converter and with reverse one. In this work, the influence of the length of the qubit state codes of heterogeneous digital quantum coprocessors on the probability of the correct results formation is investigated. It was shown that the probability of obtaining the correct results at the output of the digital heterogeneous coprocessor is sharply (up to fifty percent) improved with a decrease of the qubit state code length, that is, with a decrease in the coprocessor hardware cost. With a length of a code equal to two bits, the quality of the operation of the heterogeneous coprocessor becomes commensurate with the quality of the homogeneous one. The need for additional research in this direction, including with homogeneous coprocessors, is shown.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Yilmaz, Yalcin, and Pinaki Mazumder. "Image Processing by a Programmable Grid Comprising Quantum Dots and Memristors." IEEE Transactions on Nanotechnology 12, no. 6 (November 2013): 879–87. http://dx.doi.org/10.1109/tnano.2013.2263153.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Tripathi, S. K., Mohd Samar Ansari, and Amit M. Joshi. "Carbon Nanotubes-Based Digitally Programmable Current Follower." VLSI Design 2018 (January 17, 2018): 1–10. http://dx.doi.org/10.1155/2018/1080817.

Повний текст джерела

Анотація:

The physical constraints of ever-shrinking CMOS transistors are rapidly approaching atomistic and quantum mechanical limits. Therefore, research is now directed towards the development of nanoscale devices that could work efficiently in the sub-10 nm regime. This coupled with the fact that recent design trend for analog signal processing applications is moving towards current-mode circuits which offer lower voltage swings, higher bandwidth, and better signal linearity is the motivation for this work. A digitally controlled DVCC has been realized using CNFETs. This work exploited the CNFET’s parameters like chirality, pitch, and numbers of CNTs to perform the digital control operation. The circuit has minimum number of transistors and can control the output current digitally. A similar CMOS circuit with 32 nm CMOS parameters was also simulated and compared. The result shows that CMOS-based circuit requires 418.6 μW while CNFET-based circuit consumes 352.1 μW only. Further, the proposed circuit is used to realize a CNFET-based instrumentation amplifier with digitally programmable gain. The amplifier has a CMRR of 100 dB and ICMR equal to 0.806 V. The 3 dB bandwidth of the amplifier is 11.78 GHz which is suitable for the applications like navigation, radar instrumentation, and high-frequency signal amplification and conditioning.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Guo, Cheng, Jin Lin, Lian-Chen Han, Na Li, Li-Hua Sun, Fu-Tian Liang, Dong-Dong Li, et al. "Low-latency readout electronics for dynamic superconducting quantum computing." AIP Advances 12, no. 4 (April 1, 2022): 045024. http://dx.doi.org/10.1063/5.0088879.

Повний текст джерела

Анотація:

Dynamic quantum computing can support quantum error correction circuits to build a large general-purpose quantum computer, which requires electronic instruments to perform the closed-loop operation of readout, processing, and control within 1% of the qubit coherence time. In this paper, we present low-latency readout electronics for dynamic superconducting quantum computing. The readout electronics use a low-latency analog-to-digital converter to capture analog signals, a field-programmable gate array (FPGA) to process digital signals, and the general I/O resources of the FPGA to forward the readout results. Running an algorithm based on the design of multichannel parallelism and single instruction multiple data on an FPGA, the readout electronics achieve a readout latency of 40 ns from the last sample input to the readout valid output. The feedback data link for cross-instrument communication shows a communication latency of 48 ns when 16 bits of data are transmitted over a 2 m-length cable using a homologous clock to drive the transceiver. With codeword-based triggering mechanisms, readout electronics can be used in dynamic superconducting quantum computing.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Costa, Vinícius Lagrota Rodrigues da, Julio López, and Moisés Vidal Ribeiro. "A System-on-a-Chip Implementation of a Post-Quantum Cryptography Scheme for Smart Meter Data Communications." Sensors 22, no. 19 (September 23, 2022): 7214. http://dx.doi.org/10.3390/s22197214.

Повний текст джерела

Анотація:

The security of Smart Meter (SM) systems will be a challenge in the era of quantum computing because a quantum computer might exploit characteristics of well-established cryptographic schemes to reach a successful security breach. From a practical perspective, this paper focuses on the feasibility of implementing a quantum-secure lattice-based key encapsulation mechanism in a SM, hardware-constrained equipment. In this regard, the post-quantum cryptography (PQC) scheme, FrodoKEM, an alternate candidate for the National Institute for Standards and Technology (NIST) post-quantum standardization process, is implemented using a System-on-a-Chip (SoC) device in which the Field Programmable Gate Array (FPGA) component is exploited to accelerate the most time-consuming routines in this scheme. Experimental results show that the execution time to run the FrodoKEM scheme in an SoC device reduces to one-third of that obtained by the benchmark implementation (i.e., the software implementation). Also, the attained execution time and hardware resource usage of this SoC-based implementation of the FrodoKEM scheme show that lattice-based cryptography may fit into SM equipment.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Kostadinov, Atanas N., and Guennadi A. Kouzaev. "A Novel Processor for Artificial Intelligence Acceleration." WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS 21 (July 1, 2022): 125–41. http://dx.doi.org/10.37394/23201.2022.21.14.

Повний текст джерела

Анотація:

A variable predicate logic processor (VPLP) is proposed for artificial intelligence (AI), robotics, computer-aided medicine, electronic security, and other applications. The development is realized as an accelerating unit in AI computing machines. The difference from known designs, the datapath of this processor consists of universal gates changing on-the-fly their logical styles-subsets of predicate logic according to the data type and implemented instructions. In this paper, the processor’s reconfigurable gates and the main units are proposed, designed, modeled, and verified using a Field-Programmable Gate Array (FPGA) board and corresponding computer-aided design (CAD) tool. The implemented processor confirmed its reconfigurability on-the-fly performing testing codes. This processor is interesting in accelerating AI computing, molecular and quantum calculations in science, cryptography, computer-aided medicine, robotics, etc.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Gothandaraman, Akila, Gregory D. Peterson, G. Lee Warren, Robert J. Hinde, and Robert J. Harrison. "A Pipelined and Parallel Architecture for Quantum Monte Carlo Simulations on FPGAs." VLSI Design 2010 (February 28, 2010): 1–8. http://dx.doi.org/10.1155/2010/946486.

Повний текст джерела

Анотація:

Recent advances in Field-Programmable Gate Array (FPGA) technology make reconfigurable computing using FPGAs an attractive platform for accelerating scientific applications. We develop a deeply pipelined and parallel architecture for Quantum Monte Carlo simulations using FPGAs. Quantum Monte Carlo simulations enable us to obtain the structural and energetic properties of atomic clusters. We experiment with different pipeline structures for each component of the design and develop a deeply pipelined architecture that provides the best performance in terms of achievable clock rate, while at the same time has a modest use of the FPGA resources. We discuss the details of the pipelined and generic architecture that is used to obtain the potential energy and wave function of a cluster of atoms.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Mahdi, Suadad S., and Alharith A. Abdullah. "Enhanced Security of Software-defined Network and Network Slice Through Hybrid Quantum Key Distribution Protocol." Infocommunications journal 14, no. 3 (2022): 9–15. http://dx.doi.org/10.36244/icj.2022.3.2.

Повний текст джерела

Анотація:

Software-defined networking (SDN) has revolutionized the world of technology as networks have become more flexible, dynamic and programmable. The ability to conduct network slicing in 5G networks is one of the most crucial features of SDN implementation. Although network programming provides new security solutions of traditional networks, SDN and network slicing also have security issues, an important one being the weaknesses related to openflow channel between the data plane and controller as the network can be attacked via the openflow channel and exploit communications with the control plane. Our work proposes a solution to provide adequate security for openflow messages through using a hybrid key consisting of classical and quantum key distribution protocols to provide double security depending on the computational complexity and physical properties of quantum. To achieve this goal, the hybrid key used with transport layer security protocol to provide confidentiality, integrity and quantum authentication to secure openflow channel. We experimentally based on the SDN-testbed and network slicing to show the workflow of exchanging quantum and classical keys between the control plane and data plane and our results showed the effectiveness of the hybrid key to enhance the security of the transport layer security protocol. Thereby achieving adequate security for openflow channel against classical and quantum computer attacks.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Manzalini, Antonio. "Quantum Communications in Future Networks and Services." Quantum Reports 2, no. 1 (March 11, 2020): 221–32. http://dx.doi.org/10.3390/quantum2010014.

Повний текст джерела

Анотація:

Over the last few years, we have witnessed an impressive growth of data traffic and a progressive Digital Transformation of Industry and Society: the deployment of the ultra-broadband and low latency network infrastructures (e.g., 5G) are leading to a global digitalization of several domains. These techno-economic trends are expected to continue and even accelerate in the next decade, at end of which, 6G and smart networks and services will be exploited. Innovation will continue to drive the global economy into the next decade. This paper draws some technology trends and applications scenarios for this horizon, where Quantum Optical Communications are likely to disrupt Information and Communications Technology (ICT) and Telecommunications. Among the enabling technologies and solutions moving in this direction, this paper briefly addresses: quantum optical switching and computing, THz-to-optical conversions and advanced metamaterials for smart radio-optical programmable environments and Artificial Intelligence. The paper concludes with the description of a future application scenario, called Quantum Optical Twin, where the above Quantum Optical Communications technologies are exploited to provide services such as: ultra-massive scale communications for connected spaces and ambient intelligence, holographic telepresence, tactile Internet, new paradigms of brain computer interactions, innovative forms of communications.

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Hlukhov, V. "CAPACITIVE COMPLEXITY OF DETERMINING GCD IN THE SHOR S ALGORITHM." ELECTRICAL AND COMPUTER SYSTEMS 33, no. 108 (November 30, 2020): 26–32. http://dx.doi.org/10.15276/eltecs.32.108.2020.3.

Повний текст джерела

Анотація:

The article analyzes the results of finding the period r of the function y = axmodM (a is a random number) which is used in the Shor's factorization algorithm for quantum computers. The module M is the product of two primes p and q. The article analyzes the solutions r obtained for various a, for which the capacitive complexity H of finding the greatest common divisor GCD(ar/2 + 1, M) is the least. A digital quantum computer is a classic processor and its digital quantum coprocessor. A digital quantum coprocessor with hundreds and thousands of digital qubits can be implemented in one programmable logic integrated circuit FPGA. In the Shor’s algorithm, the factorization problem of the number M reduces to the problem of determining the period r of the function y. It is known that GCD(ar/2 + 1, M) can be a divisor of the number M The task of the quantum coprocessor in implementing the Shor’s algorithm is to find the period r. After that it is necessary to find the GCD. Since for random a the problem of finding the period r has many solutions, these solutions can be compared by the value of one of the arguments when finding the GCD - the number ar / 2 . In this case, H = (rlog2a)/2 is taken for analysis. It approximately represents the bit depth of binary codes that a classic computer will have to process when determining the GCD. H can vary over a wide range from tens to thousands of bits even for small values of M. In this research the period r, which ensures the least complexity of the subsequent task of finding the GCD, is most often a solution for a = 3 and a = 2, but it can also occur often with other values of a. To clarify the revealed patterns, especially for large M, it is necessary to conduct additional research.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Korolyov, V., M. Ogurtsov, and A. Khodzinsky. "Multilevel Identification Friend or Foe of Objects and Analysis of the Applicability of Post-Quantum Cryptographic Algorithms for Information Security." Cybernetics and Computer Technologies, no. 3 (October 27, 2020): 74–84. http://dx.doi.org/10.34229/2707-451x.20.3.7.

Повний текст джерела

Анотація:

Introduction. Widespread use of unmanned aerial vehicles in the civilian and military spheres requires the development of new algorithms for identification friend or foe of targets, as used in the Armed Forces of Ukraine (AFU) devices of the "Parol" system are designed to service approximately 110 objects military equipment. AFU automation systems allow the use of additional sources of information about various objects from civil or special data transmission networks, which can be the basis for building a networked multi-level system of state recognition. Predictions of the development of quantum computers foresee the possibility of breaking modern algorithms for information security in polynomial time in the next 5-10 years, which requires the development and implementation of new encryption algorithms and revision of modern parameters. The purpose of the article is to develop a new algorithm for state recognition of objects, which can be scaled to process the required number of manned and unmanned aerial vehicles. Potential threats to classical cryptographic protection algorithms for data networks, which will result in the execution of algorithms such as Grover and Shore on quantum computers, were also discussed. Results. The article proposes a new multilevel algorithm of state recognition based on modern cryptographic methods of information protection, which allows to perform reliable automated identification of objects, scale systems using data on potential targets from other sources through secure special networks. Grover's search algorithm does not give a strong increase in key search performance for symmetric encryption algorithms, so there is no need to increase the key lengths for this type of information security algorithms. Post-quantum asymmetric encryption algorithms require additional study and comprehensive testing of information security or increasing the key lengths of cryptographic algorithms, which corresponds to the number of qubits, i.e. more than twice. The most promising is the family of asymmetric post-quantum cryptographic algorithms based on supersingular isogenic elliptic curves. Conclusions. The developed algorithm of identification friend or foe of objects is more secure compared to existing algorithms and is focused on the use of modern on-board computers and programmable radio modems. Shore's algorithm and the like will be a significant threat to modern asymmetric cryptography algorithms when the number of qubits of quantum computers exceeds the number of bits in public keys more than twice. Keywords: identification friend or foe, symmetric encryption, asymmetric cryptography, quantum computer, post-quantum cryptography.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Sanders, Laura. "Matter & energy: Physicists find effective recipe for programmable quantum computer: Beryllium ion system tackles 160 random processing tasks." Science News 176, no. 13 (December 10, 2009): 13. http://dx.doi.org/10.1002/scin.5591761313.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Rodrı́guez-Borbón, José M., Amin Kalantar, Sharma S. R. K. C. Yamijala, M. Belén Oviedo, Walid Najjar, and Bryan M. Wong. "Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations." Journal of Chemical Theory and Computation 16, no. 4 (March 27, 2020): 2085–98. http://dx.doi.org/10.1021/acs.jctc.9b01284.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Park, Byung Kwon, Yong-Su Kim, Young-Wook Cho, Sung Moon, and Sang-Wook Han. "Arbitrary Configurable 20-Channel Coincidence Counting Unit for Multi-Qubit Quantum Experiment." Electronics 10, no. 5 (February 28, 2021): 569. http://dx.doi.org/10.3390/electronics10050569.

Повний текст джерела

Анотація:

This paper presents a 20-channel coincidence counting unit (CCU) using a low-end field-programmable gate array (FPGA). The architecture of the CCU can be configured arbitrarily to measure from twofold to twentyfold coincidence counts thanks to a multifold controllable architecture, which can be easily manipulated by a graphical user interface (GUI) program. In addition, it provides up to 20 of each input signal count simultaneously. The experimental results show twentyfold coincidence counts with the resolution occurring in a less than 0.5 ns coincidence window. This CCU has appropriate characteristics for various quantum optics experiments using multi-photon qubits.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

De Gregorio, Davide, and Santi Prestipino. "Classical and Quantum Gases on a Semiregular Mesh." Applied Sciences 11, no. 21 (October 27, 2021): 10053. http://dx.doi.org/10.3390/app112110053.

Повний текст джерела

Анотація:

The main objective of a statistical mechanical calculation is drawing the phase diagram of a many-body system. In this respect, discrete systems offer the clear advantage over continuum systems of an easier enumeration of microstates, though at the cost of added abstraction. With this in mind, we examine a system of particles living on the vertices of the (biscribed) pentakis dodecahedron, using different couplings for first and second neighbor particles to induce a competition between icosahedral and dodecahedral orders. After working out the phases of the model at zero temperature, we carry out Metropolis Monte Carlo simulations at finite temperature, highlighting the existence of smooth transitions between distinct “phases”. The sharpest of these crossovers are characterized by hysteretic behavior near zero temperature, which reveals a bottleneck issue for Metropolis dynamics in state space. Next, we introduce the quantum (Bose-Hubbard) counterpart of the previous model and calculate its phase diagram at zero and finite temperatures using the decoupling approximation. We thus uncover, in addition to Mott insulating “solids”, also the existence of supersolid “phases” which progressively shrink as the system is heated up. We argue that a quantum system of the kind described here can be realized with programmable holographic optical tweezers.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Zhou, Zhen, Debiao He, Zhe Liu, Min Luo, and Kim-Kwang Raymond Choo. "A Software/Hardware Co-Design of Crystals-Dilithium Signature Scheme." ACM Transactions on Reconfigurable Technology and Systems 14, no. 2 (June 5, 2021): 1–21. http://dx.doi.org/10.1145/3447812.

Повний текст джерела

Анотація:

As quantum computers become more affordable and commonplace, existing security systems that are based on classical cryptographic primitives, such as RSA and Elliptic Curve Cryptography ( ECC ), will no longer be secure. Hence, there has been interest in designing post-quantum cryptographic ( PQC ) schemes, such as those based on lattice-based cryptography ( LBC ). The potential of LBC schemes is evidenced by the number of such schemes passing the selection of NIST PQC Standardization Process Round-3. One such scheme is the Crystals-Dilithium signature scheme, which is based on the hard module-lattice problem. However, there is no efficient implementation of the Crystals-Dilithium signature scheme. Hence, in this article, we present a compact hardware architecture containing elaborate modular multiplication units using the Karatsuba algorithm along with smart generators of address sequence and twiddle factors for NTT, which can complete polynomial addition/multiplication with the parameter setting of Dilithium in a short clock period. Also, we propose a fast software/hardware co-design implementation on Field Programmable Gate Array ( FPGA ) for the Dilithium scheme with a tradeoff between speed and resource utilization. Our co-design implementation outperforms a pure C implementation on a Nios-II processor of the platform Altera DE2-115, in the sense that our implementation is 11.2 and 7.4 times faster for signature and verification, respectively. In addition, we also achieve approximately 51% and 31% speed improvement for signature and verification, in comparison to the pure C implementation on processor ARM Cortex-A9 of ZYNQ-7020 platform.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Göç, Yavuz Burak, Jakub Poziemski, Weronika Smolińska, Dominik Suwała, Grzegorz Wieczorek, and Dorota Niedzialek. "Tracking Topological and Electronic Effects on the Folding and Stability of Guanine-Deficient RNA G-Quadruplexes, Engineered with a New Computational Tool for De Novo Quadruplex Folding." International Journal of Molecular Sciences 23, no. 19 (September 20, 2022): 10990. http://dx.doi.org/10.3390/ijms231910990.

Повний текст джерела

Анотація:

The initial aim of this work was to elucidate the mutual influence of different single-stranded segments (loops and caps) on the thermodynamic stability of RNA G-quadruplexes. To this end, we used a new NAB-GQ-builder software program, to construct dozens of two-tetrad G-quadruplex topologies, based on a designed library of sequences. Then, to probe the sequence–morphology–stability relationships of the designed topologies, we performed molecular dynamics simulations. Their results provide guidance for the design of G-quadruplexes with balanced structures, and in turn programmable physicochemical properties for applications as biomaterials. Moreover, by comparative examinations of the single-stranded segments of three oncogene promoter G-quadruplexes, we assess their druggability potential for future therapeutic strategies. Finally, on the basis of a thorough analysis at the quantum mechanical level of theory on a series of guanine assemblies, we demonstrate how a valence tautomerism, triggered by a coordination of cations, initiates the process of G-quadruplex folding, and we propose a sequential folding mechanism, otherwise dictated by the cancellation of the dipole moments on guanines.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Smaliychuk, A., and Volodymyr Babyak. "TRANSFORMATION IN ARCHITECTURE AFTER NEW ENERGY INFORMATION REVOLUTION." Vìsnik Nacìonalʹnogo unìversitetu "Lʹvìvsʹka polìtehnìka". Serìâ Arhìtektura 4, no. 2 (December 22, 2022): 162–69. http://dx.doi.org/10.23939/sa2022.02.162.

Повний текст джерела

Анотація:

It is important to take into account not only existing trends, analyzing development of architecture, but also to predict the probable ones. They may occur in the medium term, around 2050. Energy and information are two key areas that determine all other aspects of human life. The most important task of the energy sector is to provide clean energy in amounts not less than the current ones in the future. The only one possible source of clean energy that will provide all current needs for a million years is fusion. Quantum computer is considered a “Holy Grail” of IT sector. This computer speed exceeds the current PCs by millions of times, which opens unprecedented opportunities in all areas and allows the transition to new technological systems. New threats and challenges will arise in addition to new opportunities. It is very likely that, the concept of sustainable development and the recovery economy may not dominate after 2050. This change will mark a new stage in the development of architecture in the 22nd century. The most obvious changes will be the creation and use of new materials with programmable properties, the creation of architectural objects in inaccessible regions of the planet, the radical improvement of digital models of projected objects. Structural and engineering constraints will be much less, or virtually absent, for simple objects. Рractically unlimited power of computers will change most aspects of design, and the visual component of projects will be more like 5D movies than realistic visualizations today. Threats and challenges created by projected changes aren’t less impotent. Probably, architecture, like many other areas of human life, may be absorbed or subordinated to the IT branch. Forms of human existence and can be the most serious challenge of virtualization of social life. Dominance of the virtual over the reality may raise questions about sense of human nature at all. Artificial intelligence can be main creator of architecture. Role and place of architecture in society life will not the top ten in importance. It is also possible an architecture, separation on “new” and “old”, “human” and “computer” or by other dividing lines. Another challenge is the possibility of converging or even merging with design and cinema. Other tendencies of architecture development are also probable – multiplicity of design, internal structural ordering of architecture, new renaissance (revival) of architecture, higher degree of invasion of privacy when customer is a human person.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Park, Yunjae, Hyunseok Oh, Seungwoo Yoo, Taehyun Kim, and Dongil “Dan” Cho. "A Feedback Control Method to Maintain the Amplitude of the RF Signal Applied to Ion Traps." Applied Sciences 11, no. 2 (January 17, 2021): 837. http://dx.doi.org/10.3390/app11020837.

Повний текст джерела

Анотація:

For high-fidelity quantum operations in ion traps, it is important to maintain the secular frequency of the trapped ions at a constant value. The radial secular frequency is proportional to the amplitude of the radio frequency (RF) signal applied to ion traps. Owing to the changes in the ambient temperature of a helical resonator and the minute vibration of the optical table, the amplitude can vary. Recently, a method for reducing the fluctuation in the RF signal amplitude, using a commercial universal proportional-plus-integral (PI) controller, has been introduced, which, in turn, reduces the secular frequency drift of the trapped ions. The method improves the capability to maintain the secular frequency at a constant value. However, the structure of the controller is fixed; thus, the control method cannot be changed to suit different experimental conditions, and the different feedback configuration cannot be implemented to increase the resolution. In this paper, we develop a field-programmable gate array (FPGA)-based feedback controller that allows the implementation of various automatic control methods and feedback configurations. In our experiments, the fluctuation in the amplitude of the RF signal was 1.806% using a commercial universal PI controller. The fluctuation was reduced to 0.099% using the developed FPGA-based PI controller, and to 0.102% using the developed FPGA-based lag compensator. By employing the developed FPGA control method, many other automating control methods can be applied to achieve a stable and high-performance control of the secular frequency.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Susilo, Sugeng Hadi, Asrori Asrori, and Gumono Gumono. "Analysis of the effect of stirrer and container rotation direction on mixing index (Ip)." Eastern-European Journal of Enterprise Technologies 3, no. 1 (111) (June 10, 2021): 86–91. http://dx.doi.org/10.15587/1729-4061.2021.233062.

Повний текст джерела

Анотація:

The paper discusses the effect of the stirrer and container rotation direction on the mixing index (Ip). The chaos theory is the result of an in-depth study of various problems that cannot be answered by the two previous major theories, namely quantum mechanics and the theory of relativity. Effective mixing of the flow area does not depend on rapid stirring. This study uses a container with a double stirrer, camera, programmable logic controller, tachometer, 6 A adapter, and a computer. DC electric motor (25 V) for turning stirrers and housings. The diameter of the primary and secondary stirrers is Dp=38 mm and Ds=17 mm. The diameter of the container made of transparent plastic is Dw=160 mm and height is 170 mm. Primary stirrer rotation (np)=10 rpm, secondary stirrer rotation (ns)=22.3 rpm, and container rotation (nw)=13 rpm, the angular velocity of the container is Ww=360° while the angular speed of the primary stirrer is Wp=180°. The liquid consists of a mixture of water and paint (white). For dye, a mixture of water and paint (red) is used. For testing the Brookfield viscometer, the viscosity of the liquid and dye is used. The results showed that turning the stirrer in the opposite direction to the container, there will be stretching, bending, and folding around the stirrer, and the smallest mixing index was P2V-b (0.94). In addition, based on the mixing index value above, the highest mixing effectiveness level is obtained, namely: P2V-b, P2S-b, P2B-b, P2V-a, P2B-a, and finally P2S-a. The mixing index is inversely related to the effectiveness level. So the highest effectiveness level is given by the following treatment: 1. Variation rotation (between opposite rotating mixers), 2. Opposite rotation (stirrer rotation opposite direction to the container), 3. Unidirectional rotation (stirrer rotation in the direction of the container)

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Faehrmann, Paul K., Mark Steudtner, Richard Kueng, Mária Kieferová, and Jens Eisert. "Randomizing multi-product formulas for Hamiltonian simulation." Quantum 6 (September 19, 2022): 806. http://dx.doi.org/10.22331/q-2022-09-19-806.

Повний текст джерела

Анотація:

Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of quantum simulation algorithms are deterministic, a recent surge of ideas has shown that randomization can greatly benefit algorithmic performance. In this work, we introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multiproduct formulas, as they are used for example in linear-combination-of-unitaries (LCU) algorithms or quantum error mitigation, on the other hand. In doing so, we propose a framework of randomized sampling that is expected to be useful for programmable quantum simulators and present two new multi-product formula algorithms tailored to it. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification required by the implementation of multi-product formulas using standard LCU methods, rendering it especially useful for early quantum computers used to estimate the dynamics of quantum systems instead of performing full-fledged quantum phase estimation. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth. To corroborate their functioning, we prove rigorous performance bounds as well as the concentration of the randomized sampling procedure. We demonstrate the functioning of the approach for several physically meaningful examples of Hamiltonians, including fermionic systems and the Sachdev–Ye–Kitaev model, for which the method provides a favorable scaling in the effort.

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Harris, Nicholas C., Darius Bunandar, Mihir Pant, Greg R. Steinbrecher, Jacob Mower, Mihika Prabhu, Tom Baehr-Jones, Michael Hochberg, and Dirk Englund. "Large-scale quantum photonic circuits in silicon." Nanophotonics 5, no. 3 (August 1, 2016): 456–68. http://dx.doi.org/10.1515/nanoph-2015-0146.

Повний текст джерела

Анотація:

AbstractQuantum information science offers inherently more powerful methods for communication, computation, and precision measurement that take advantage of quantum superposition and entanglement. In recent years, theoretical and experimental advances in quantum computing and simulation with photons have spurred great interest in developing large photonic entangled states that challenge today’s classical computers. As experiments have increased in complexity, there has been an increasing need to transition bulk optics experiments to integrated photonics platforms to control more spatial modes with higher fidelity and phase stability. The silicon-on-insulator (SOI) nanophotonics platform offers new possibilities for quantum optics, including the integration of bright, nonclassical light sources, based on the large third-order nonlinearity (χ(3)) of silicon, alongside quantum state manipulation circuits with thousands of optical elements, all on a single phase-stable chip. How large do these photonic systems need to be? Recent theoretical work on Boson Sampling suggests that even the problem of sampling from e30 identical photons, having passed through an interferometer of hundreds of modes, becomes challenging for classical computers. While experiments of this size are still challenging, the SOI platform has the required component density to enable low-loss and programmable interferometers for manipulating hundreds of spatial modes.Here, we discuss the SOI nanophotonics platform for quantum photonic circuits with hundreds-to-thousands of optical elements and the associated challenges. We compare SOI to competing technologies in terms of requirements for quantum optical systems. We review recent results on large-scale quantum state evolution circuits and strategies for realizing high-fidelity heralded gates with imperfect, practical systems. Next, we review recent results on silicon photonics-based photon-pair sources and device architectures, and we discuss a path towards large-scale source integration. Finally, we review monolithic integration strategies for single-photon detectors and their essential role in on-chip feed forward operations.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Deshpande, Abhinav, Arthur Mehta, Trevor Vincent, Nicolás Quesada, Marcel Hinsche, Marios Ioannou, Lars Madsen, et al. "Quantum computational advantage via high-dimensional Gaussian boson sampling." Science Advances 8, no. 1 (January 7, 2022). http://dx.doi.org/10.1126/sciadv.abi7894.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Chi, Yulin, Jieshan Huang, Zhanchuan Zhang, Jun Mao, Zinan Zhou, Xiaojiong Chen, Chonghao Zhai, et al. "A programmable qudit-based quantum processor." Nature Communications 13, no. 1 (March 4, 2022). http://dx.doi.org/10.1038/s41467-022-28767-x.

Повний текст джерела

Анотація:

AbstractControlling and programming quantum devices to process quantum information by the unit of quantum dit, i.e., qudit, provides the possibilities for noise-resilient quantum communications, delicate quantum molecular simulations, and efficient quantum computations, showing great potential to enhance the capabilities of qubit-based quantum technologies. Here, we report a programmable qudit-based quantum processor in silicon-photonic integrated circuits and demonstrate its enhancement of quantum computational parallelism. The processor monolithically integrates all the key functionalities and capabilities of initialisation, manipulation, and measurement of the two quantum quart (ququart) states and multi-value quantum-controlled logic gates with high-level fidelities. By reprogramming the configuration of the processor, we implemented the most basic quantum Fourier transform algorithms, all in quaternary, to benchmark the enhancement of quantum parallelism using qudits, which include generalised Deutsch-Jozsa and Bernstein-Vazirani algorithms, quaternary phase estimation and fast factorization algorithms. The monolithic integration and high programmability have allowed the implementations of more than one million high-fidelity preparations, operations and projections of qudit states in the processor. Our work shows an integrated photonic quantum technology for qudit-based quantum computing with enhanced capacity, accuracy, and efficiency, which could lead to the acceleration of building a large-scale quantum computer.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Wright, K., K. M. Beck, S. Debnath, J. M. Amini, Y. Nam, N. Grzesiak, J. S. Chen, et al. "Benchmarking an 11-qubit quantum computer." Nature Communications 10, no. 1 (November 29, 2019). http://dx.doi.org/10.1038/s41467-019-13534-2.

Повний текст джерела

Анотація:

AbstractThe field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5$$\%$$%, average two-qubit-gate fidelities of 97.5$$\%$$%, and SPAM errors of 0.7$$\%$$%. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78$$\%$$% and 35$$\%$$%, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Huerta Alderete, C., Shivani Singh, Nhung H. Nguyen, Daiwei Zhu, Radhakrishnan Balu, Christopher Monroe, C. M. Chandrashekar, and Norbert M. Linke. "Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer." Nature Communications 11, no. 1 (July 24, 2020). http://dx.doi.org/10.1038/s41467-020-17519-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Figgatt, C., D. Maslov, K. A. Landsman, N. M. Linke, S. Debnath, and C. Monroe. "Complete 3-Qubit Grover search on a programmable quantum computer." Nature Communications 8, no. 1 (December 2017). http://dx.doi.org/10.1038/s41467-017-01904-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Li, Yuan, Lingxiao Wan, Hui Zhang, Huihui Zhu, Yuzhi Shi, Lip Ket Chin, Xiaoqi Zhou, Leong Chuan Kwek, and Ai Qun Liu. "Quantum Fredkin and Toffoli gates on a versatile programmable silicon photonic chip." npj Quantum Information 8, no. 1 (September 15, 2022). http://dx.doi.org/10.1038/s41534-022-00627-y.

Повний текст джерела

Анотація:

AbstractQuantum logic gates are backbones of quantum information processing (QIP), wherein the typical three-qubit Fredkin and Toffoli gates are essential in quantum computation and communication. So far, the quantum Fredkin gate has only been demonstrated with pre-entangled input states in free-space optics, which limits its usage for independent input photons. Here, we put forward an exquisite scheme and experimentally perform a proof-of-principle demonstration of three-qubit Fredkin and Toffoli gates on a programmable quantum photonic chip. Our scheme can also be used to realize a series of other two-qubit quantum gates. Our work sheds light on the merits of quantum photonic chip in implementing quantum logic gates, and paves the way for advanced quantum chip processors.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Yi, Haibo, Ruinan Chi, Xin Huang, Xuejun Cai, and Zhe Nie. "Improving Security of Internet of Vehicles Based on Post-Quantum Signatures with Systolic Divisions." ACM Transactions on Internet Technology, February 3, 2022. http://dx.doi.org/10.1145/3410445.

Повний текст джерела

Анотація:

Internet of Things (IoTs) techniques have been employed in many areas, e.g., vehicles, smart home, medicine. Among the applications of IoTs, Internet of Vehicles (IoVs) are one of the most popular techniques. IoVs are protected by public key cryptographic systems, such as RSA and ECC. However, such systems are vulnerable to quantum computer attacks. Thus, we improve the security of IoVs based post-quantum signatures, which can resist quantum computer attacks. The key operations are divisions in a finite field. Hence, we improve the security of IoVs based post-quantum signatures with division by employing systolic architectures. We propose a systolic architecture for computing division in composite fields. After that, we improve the IoT security based post-quantum signatures with systolic divisions. We test and verify our design on a Field-Programmable Gate Array (FPGA), the experimental results confirm our estimates. Furthermore, the optimized method proposed can be further applied to various applications like solving system of linear equations and cryptographic applications for IoT security.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Brette, Romain. "Brains as Computers: Metaphor, Analogy, Theory or Fact?" Frontiers in Ecology and Evolution 10 (April 29, 2022). http://dx.doi.org/10.3389/fevo.2022.878729.

Повний текст джерела

Анотація:

Whether electronic, analog or quantum, a computer is a programmable machine. Wilder Penfield held that the brain is literally a computer, because he was a dualist: the mind programs the brain. If this type of dualism is rejected, then identifying the brain to a computer requires defining what a brain “program” might mean and who gets to “program” the brain. If the brain “programs” itself when it learns, then this is a metaphor. If evolution “programs” the brain, then this is a metaphor. Indeed, in the neuroscience literature, the brain-computer is typically not used as an analogy, i.e., as an explicit comparison, but metaphorically, by importing terms from the field of computers into neuroscientific discourse: we assert that brains compute the location of sounds, we wonder how perceptual algorithms are implemented in the brain. Considerable difficulties arise when attempting to give a precise biological description of these terms, which is the sign that we are indeed dealing with a metaphor. Metaphors can be both useful and misleading. The appeal of the brain-computer metaphor is that it promises to bridge physiological and mental domains. But it is misleading because the basis of this promise is that computer terms are themselves imported from the mental domain (calculation, memory, information). In other words, the brain-computer metaphor offers a reductionist view of cognition (all cognition is calculation) rather than a naturalistic theory of cognition, hidden behind a metaphoric blanket.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Huang, Kaixuan, Zheng-An Wang, Chao Song, Kai Xu, Hekang Li, Zhen Wang, Qiujiang Guo, et al. "Quantum generative adversarial networks with multiple superconducting qubits." npj Quantum Information 7, no. 1 (December 2021). http://dx.doi.org/10.1038/s41534-021-00503-1.

Повний текст джерела

Анотація:

AbstractGenerative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum processors, their quantum counterparts—called quantum generative adversarial networks (QGANs)—may even exhibit exponential advantages in certain machine learning applications. Here, we report an experimental implementation of a QGAN using a programmable superconducting processor, in which both the generator and the discriminator are parameterized via layers of single- and two-qubit quantum gates. The programmed QGAN runs automatically several rounds of adversarial learning with quantum gradients to achieve a Nash equilibrium point, where the generator can replicate data samples that mimic the ones from the training set. Our implementation is promising to scale up to noisy intermediate-scale quantum devices, thus paving the way for experimental explorations of quantum advantages in practical applications with near-term quantum technologies.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Xu, Yilun, Gang Huang, Jan Balewski, Alexis Morvan, Kasra Nowrouzi, David I. Santiago, Ravi K. Naik, Brad Mitchell, and Irfan Siddiqi. "Automatic Qubit Characterization and Gate Optimization with QubiC." ACM Transactions on Quantum Computing, April 13, 2022. http://dx.doi.org/10.1145/3529397.

Повний текст джерела

Анотація:

As the size and complexity of a quantum computer increases, quantum bit (qubit) characterization and gate optimization become complex and time-consuming tasks. Current calibration techniques require complicated and verbose measurements to tune up qubits and gates, which cannot easily expand to the large-scale quantum systems. We develop a concise and automatic calibration protocol to characterize qubits and optimize gates using QubiC , which is an open source FPGA (field-programmable gate array) based control and measurement system for superconducting quantum information processors. We propose multi-dimensional loss-based optimization of single-qubit gates and full XY-plane measurement method for the two-qubit CNOT gate calibration. We demonstrate the QubiC automatic calibration protocols are capable of delivering high-fidelity gates on the state-of-the-art transmon-type processor operating at the Advanced Quantum Testbed at Lawrence Berkeley National Laboratory. The single-qubit and two-qubit Clifford gate infidelities measured by randomized benchmarking are of 4.9(1.1) × 10 − 4 and 1.4(3) × 10 − 2 , respectively.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Taylor, Jeffrey C., Eric Chatterjee, William F. Kindel, Daniel Soh, and Matt Eichenfield. "Reconfigurable quantum phononic circuits via piezo-acoustomechanical interactions." npj Quantum Information 8, no. 1 (February 17, 2022). http://dx.doi.org/10.1038/s41534-022-00526-2.

Повний текст джерела

Анотація:

AbstractWe show that piezoelectric strain actuation of acoustomechanical interactions can produce large phase velocity changes in an existing quantum phononic platform: aluminum nitride on suspended silicon. Using finite element analysis, we demonstrate a piezo-acoustomechanical phase shifter waveguide capable of producing ±π phase shifts for GHz frequency phonons in 10s of μm with 10s of volts applied. Then, using the phase shifter as a building block, we demonstrate several phononic integrated circuit elements useful for quantum information processing. In particular, we show how to construct programmable multi-mode interferometers for linear phononic processing and a dynamically reconfigurable phononic memory that can switch between an ultra-long-lifetime state and a state strongly coupled to its bus waveguide. From the master equation for the full open quantum system of the reconfigurable phononic memory, we show that it is possible to perform read and write operations with over 90% quantum state transfer fidelity for an exponentially decaying pulse.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Shih, Chung-You, Sainath Motlakunta, Nikhil Kotibhaskar, Manas Sajjan, Roland Hablützel, and Rajibul Islam. "Reprogrammable and high-precision holographic optical addressing of trapped ions for scalable quantum control." npj Quantum Information 7, no. 1 (April 8, 2021). http://dx.doi.org/10.1038/s41534-021-00396-0.

Повний текст джерела

Анотація:

AbstractHigh-precision, individually programmable manipulation of quantum particles is crucial for scaling up quantum information processing (QIP) systems such as laser-cooled trapped-ions. However, restricting undesirable “crosstalk” in optical manipulation of ion qubits is fundamentally challenging due to micron-level inter-ion separation. Further, inhomogeneous ion spacing and high susceptibility to aberrations at UV wavelengths suitable for most ion-species pose severe challenges. Here, we demonstrate high-precision individual addressing (λ = 369.5 nm) of Yb+ using a reprogrammable Fourier hologram. The precision is achieved through in-situ aberration characterization via the trapped ion, and compensating (to λ/20) with the hologram. Using an iterative Fourier transformation algorithm (IFTA), we demonstrate an ultra-low (<10−4) intensity crosstalk error in creating arbitrary pair-wise addressing profiles, suitable for over fifty ions. This scheme relies on standard commercial hardware, can be readily extended to over a hundred ions, and adapted to other ion-species and quantum platforms.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

CAO, Qian, Pengkun Zheng, and Qiwen Zhan. "Vectorial sculpturing of spatiotemporal wavepackets." APL Photonics, August 15, 2022. http://dx.doi.org/10.1063/5.0107411.

Повний текст джерела

Анотація:

Spatiotemporal vectorial pulse shaping can produce ultrafast optical pulses that enable unprecedented coherent control for light matter interactions. Traditional pulse shaper produces ultrafast pulses with scalar programmable waveforms for various quantum control applications. However, quantum systems are three dimensional in nature thus the interactions are inevitability vectorial. Existing polarization pulse shaping techniques, which are often difficult to align and cumbersome to handle, can only produce dynamic polarization modulation in the temporal domain. Through simply introducing a quarter-wave plate in a pulse shaper using a two-dimensional spatial light modulator, we show that wavepackets with much more sophisticated spatiotemporal vectorial structures such as spatiotemporal spin grating, spatiotemporal spin lattice and spatiotemporally twisting polarization can be generated, significantly expanding our ability in coherently controlling light matter interactions that may find broad applications.

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Programmable quantum computer"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями