Se connecter

Bibliographies thématiques / Multi-qubit quantum gates

Sommaire

Articles de revues
Thèses
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « Multi-qubit quantum gates »

Auteur : Grafiati

Publié le 15 mars 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Multi-qubit quantum gates ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Multi-qubit quantum gates"

1

Baßler, Pascal, Markus Heinrich et Martin Kliesch. « Time-optimal multi-qubit gates : Complexity, efficient heuristic and gate-time bounds ». Quantum 8 (13 mars 2024) : 1279. http://dx.doi.org/10.22331/q-2024-03-13-1279.

Texte intégral

Résumé :

Multi-qubit entangling interactions arise naturally in several quantum computing platforms and promise advantages over traditional two-qubit gates. In particular, a fixed multi-qubit Ising-type interaction together with single-qubit X-gates can be used to synthesize global ZZ-gates (GZZ gates). In this work, we first show that the synthesis of such quantum gates that are time-optimal is NP-hard. Second, we provide explicit constructions of special time-optimal multi-qubit gates. They have constant gate times and can be implemented with linearly many X-gate layers. Third, we develop a heuristic algorithm with polynomial runtime for synthesizing fast multi-qubit gates. Fourth, we derive lower and upper bounds on the optimal GZZ gate-time. Based on explicit constructions of GZZ gates and numerical studies, we conjecture that any GZZ gate can be executed in a time O(n) for n qubits. Our heuristic synthesis algorithm leads to GZZ gate-times with a similar scaling, which is optimal in this sense. We expect that our efficient synthesis of fast multi-qubit gates allows for faster and, hence, also more error-robust execution of quantum algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

2

HEYDARI, HOSHANG. « GENERALIZED CONTROLLED PHASE QUANTUM GATES ENTANGLERS ». International Journal of Quantum Information 07, n^o 06 (septembre 2009) : 1211–16. http://dx.doi.org/10.1142/s021974990900581x.

Texte intégral

Résumé :

We construct a generalized controlled phased gate entangler for a multi-qubit state based on the geometrical structure of quantum systems. We also investigate the relation between the generalized controlled phase construction of a quantum gate entangler and graph state for two-qubit and three-qubit states.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Atiya, Abdulkader H., et Mohammed Al-Temimi. « Review of Recent Laser Technology of Development Multi Qubit Gates Using Ion Trap Method ». Applied Mechanics and Materials 915 (18 août 2023) : 33–42. http://dx.doi.org/10.4028/p-j6vsf9.

Texte intégral

Résumé :

The qubit technology using Trapped ions are taking the systems for practical quantum computing (QC). The normal requirements to achieve quantum supremacy have all been studied with ions, and quantum algorithms use ion-qubit systems have been implemented. I cover in this study many points regarding the concept of Qubit through Ion Trap, near application, and experiments also explore the Multi gates, Hybrid gates implementations

Styles APA, Harvard, Vancouver, ISO, etc.

4

Sun, Shiya, et Huisheng Zhang. « Deterministic quantum cyclic controlled teleportation of arbitrary multi-qubit states using multi-qubit partially entangled channel ». Modern Physics Letters A 35, n^o 25 (30 juin 2020) : 2050204. http://dx.doi.org/10.1142/s0217732320502041.

Texte intégral

Résumé :

In this paper, we present a deterministic four-party quantum cyclic controlled teleportation (QCYCT) scheme, by using a multi-qubit partially entangled state as the quantum channel. In this scheme, Alice can teleport an arbitrary [Formula: see text]-qubit state to Bob, Bob can teleport an arbitrary [Formula: see text]-qubit state to Charlie and Charlie can teleport an arbitrary [Formula: see text]-qubit state to Alice under the control of the supervisor David. We utilize rotation gate, Hadamard gates and controlled-NOT (CNOT) gates to construct the multi-qubit partially entangled channel. Only Bell-state measurements, single-qubit von-Neumann measurement and proper unitary operations are required in this scheme, which can be realized in practice easily based on the present quantum experiment technologies. The direction of cyclic controlled teleportation of arbitrary multi-qubit states can also be changed by altering the quantum channel. Analysis demonstrates that the success probability of the proposed scheme can still reach 100% although the quantum channel is non-maximally entangled. Furthermore, the proposed four-party scheme can be generalized into the case involving [Formula: see text] correspondents, which is more suitable for quantum communication networks. We also calculate the intrinsic efficiency and discuss the security of the proposed scheme. Compared with the existing QCYCT schemes which realized cyclic controlled teleportation of arbitrary single-qubit states, specific two-qubit and three-qubit states, the proposed scheme is of general significance.

Styles APA, Harvard, Vancouver, ISO, etc.

5

Gao, Xiaoqin, Paul Appel, Nicolai Friis, Martin Ringbauer et Marcus Huber. « On the role of entanglement in qudit-based circuit compression ». Quantum 7 (16 octobre 2023) : 1141. http://dx.doi.org/10.22331/q-2023-10-16-1141.

Texte intégral

Résumé :

Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the major experimental challenges since it requires controlled interactions between individual systems. To make the most of quantum hardware it is crucial to process information in the most efficient way. One promising avenue is to use higher-dimensional systems, qudits, as the fundamental units of quantum information, in order to replace a fraction of the qubit-entangling gates with qudit-local gates. Here, we show how the complexity of multi-qubit circuits can be lowered significantly by employing qudit encodings, which we quantify by considering exemplary circuits with exactly known (multi-qubit) gate complexity. We discuss general principles for circuit compression, derive upper and lower bounds on the achievable advantage, and highlight the key role played by entanglement and the available gate set. Explicit experimental schemes for photonic as well as for trapped-ion implementations are provided and demonstrate a significant expected gain in circuit performance for both platforms.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Baßler, Pascal, Matthias Zipper, Christopher Cedzich, Markus Heinrich, Patrick H. Huber, Michael Johanning et Martin Kliesch. « Synthesis of and compilation with time-optimal multi-qubit gates ». Quantum 7 (20 avril 2023) : 984. http://dx.doi.org/10.22331/q-2023-04-20-984.

Texte intégral

Résumé :

We develop a method to synthesize a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. The only requirement on the flexibility of the interaction is that it can be switched on and off for individual qubits. Our method yields a time-optimal implementation of the multi-qubit gates. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits. Using this gate synthesis as a subroutine, we provide compilation strategies for important use cases: (i) we show that any Clifford circuit on n qubits can be implemented using at most 2n multi-qubit gates without requiring ancilla qubits, (ii) we decompose the quantum Fourier transform in a similar fashion, (iii) we compile a simulation of molecular dynamics, and (iv) we propose a method for the compilation of diagonal unitaries with time-optimal multi-qubit gates, as a step towards general unitaries. As motivation, we provide a detailed discussion on a microwave controlled ion trap architecture with magnetic gradient induced coupling (MAGIC) for the generation of the Ising-type interactions.

Styles APA, Harvard, Vancouver, ISO, etc.

7

Stas, P. J., Y. Q. Huan, B. Machielse, E. N. Knall, A. Suleymanzade, B. Pingault, M. Sutula et al. « Robust multi-qubit quantum network node with integrated error detection ». Science 378, n^o 6619 (4 novembre 2022) : 557–60. http://dx.doi.org/10.1126/science.add9771.

Texte intégral

Résumé :

Long-distance quantum communication and networking require quantum memory nodes with efficient optical interfaces and long memory times. We report the realization of an integrated two-qubit network node based on silicon-vacancy centers (SiVs) in diamond nanophotonic cavities. Our qubit register consists of the SiV electron spin acting as a communication qubit and the strongly coupled silicon-29 nuclear spin acting as a memory qubit with a quantum memory time exceeding 2 seconds. By using a highly strained SiV, we realize electron-photon entangling gates at temperatures up to 1.5 kelvin and nucleus-photon entangling gates up to 4.3 kelvin. We also demonstrate efficient error detection in nuclear spin–photon gates by using the electron spin as a flag qubit, making this platform a promising candidate for scalable quantum repeaters.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Litinski, Daniel, et Felix von Oppen. « Lattice Surgery with a Twist : Simplifying Clifford Gates of Surface Codes ». Quantum 2 (4 mai 2018) : 62. http://dx.doi.org/10.22331/q-2018-05-04-62.

Texte intégral

Résumé :

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range multi-target CNOT gates with a time overhead that scales only logarithmically with the control-target separation. This is done by replacing hardware operations for single-qubit Clifford gates with a classical tracking protocol. Inter-qubit communication is added via a modified lattice surgery protocol that employs twist defects of the surface code. The long-range multi-target CNOT gates facilitate magic state distillation, which renders our scheme fault-tolerant and universal.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Urías, Jesús, et Diego A. Quiñones. « Householder methods for quantum circuit design ». Canadian Journal of Physics 94, n^o 2 (février 2016) : 150–57. http://dx.doi.org/10.1139/cjp-2015-0490.

Texte intégral

Résumé :

Algorithms to resolve multiple-qubit unitary transformations into a sequence of simple operations on one-qubit subsystems are central to the methods of quantum-circuit simulators. We adapt Householder’s theorem to the tensor-product character of multi-qubit state vectors and translate it to a combinatorial procedure to assemble cascades of quantum gates that recreate any unitary operation U acting on n-qubit systems. U may be recreated by any cascade from a set of combinatorial options that, in number, are not lesser than super-factorial of 2n, [Formula: see text]. Cascades are assembled with one-qubit controlled-gates of a single type. We complement the assembly procedure with a new algorithm to generate Gray codes that reduce the combinatorial options to cascades with the least number of CNOT gates. The combined procedure —factorization, gate assembling, and Gray ordering — is illustrated on an array of three qubits.

Styles APA, Harvard, Vancouver, ISO, etc.

10

Ufrecht, Christian, Maniraman Periyasamy, Sebastian Rietsch, Daniel D. Scherer, Axel Plinge et Christopher Mutschler. « Cutting multi-control quantum gates with ZX calculus ». Quantum 7 (23 octobre 2023) : 1147. http://dx.doi.org/10.22331/q-2023-10-23-1147.

Texte intégral

Résumé :

Circuit cutting, the decomposition of a quantum circuit into independent partitions, has become a promising avenue towards experiments with larger quantum circuits in the noisy-intermediate scale quantum (NISQ) era. While previous work focused on cutting qubit wires or two-qubit gates, in this work we introduce a method for cutting multi-controlled Z gates. We construct a decomposition and prove the upper bound O(62K) on the associated sampling overhead, where K is the number of cuts in the circuit. This bound is independent of the number of control qubits but can be further reduced to O(4.52K) for the special case of CCZ gates. Furthermore, we evaluate our proposal on IBM hardware and experimentally show noise resilience due to the strong reduction of CNOT gates in the cut circuits.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "Multi-qubit quantum gates"

1

Sriarunothai, Theeraphot [Verfasser]. « Multi-qubit gates and quantum-enhanced deliberation for machine learning using a trapped-ion quantum processor / Theeraphot Sriarunothai ». Siegen : Universitätsbibliothek der Universität Siegen, 2019. http://d-nb.info/1177366320/34.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Navickas, Tomas. « Towards high-fidelity microwave driven multi-qubit gates on microfabricated surface ion traps ». Thesis, University of Sussex, 2018. http://sro.sussex.ac.uk/id/eprint/79060/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Srivastava, Vineesha. « Entanglement generation and quantum gates with quantum emitters in a cavity ». Electronic Thesis or Diss., Strasbourg, 2024. http://www.theses.fr/2024STRAF069.

Texte intégral

Résumé :

Cette thèse présente de nouveaux protocoles pour les portes quantiques multi-qubits non locales et la génération d’intrication dans des systèmes où plusieurs émetteurs quantiques interagissent avec un mode bosonique partagé. Elle introduit les portes de phase géométrique et adiabatique, avec des expressions analytiques de l’infidélité dépendant du nombre de qubits et de la coopérativité. Pour deux qubits, elles forment un ensemble universel, tandis que dans les systèmes multi-qubits, elles permettent des portes déterministes pour la simulation quantique et la correction d’erreurs. Une contribution majeure est un protocole de détection optimisé par l’intrication, atteignant une haute précision de mesure grâce au contrôle optimal. La thèse explore aussi un mécanisme de blocage polaritonique en cavité pour la génération d’états W non locaux et de portes multi-qubits. Ces opérations déterministes, basées sur des excitations classiques de cavité et parfois des impulsions globales, offrent une base évolutive pour l’informatique quantique, la détection quantique et l'internet quantique de demain, en particulier pour les systèmes à atomes neutres
This thesis presents novel protocols for non-local multi-qubit quantum gates and entanglement generation in systems where multiple quantum emitters interact with a shared bosonic mode. It introduces the Geometric and Adiabatic Phase Gates, with closed-form infidelity expressions scaling with qubit number and cooperativity. For two qubits, these form a universal gate set, while in multi-qubit systems, they enable deterministic gates for quantum simulation and quantum error correction. A key contribution is an entanglement-enhanced sensing protocol that achieves high measurement precision via optimal control. The thesis also examines a cavity polariton blockade mechanism for non-local W-state generation and multi-qubit gates. These deterministic multi-qubit operations rely only on classical cavity drives and, in some cases, global qubit pulses, providing a scalable foundation for quantum computing, sensing, and the future quantum internet, especially for neutral atom systems

Styles APA, Harvard, Vancouver, ISO, etc.

4

Vourdas, Apostolos. « Exterior calculus and fermionic quantum computation ». 2018. http://hdl.handle.net/10454/16618.

Texte intégral

Résumé :

Yes
Exterior calculus with its three operations meet, join and hodge star complement, is used for the representation of fermion-hole systems and for fermionic analogues of logical gates. Two different schemes that implement fermionic quantum computation, are proposed. The first scheme compares fermionic gates with Boolean gates, and leads to novel electronic devices that simulate fermionic gates. The second scheme uses a well known map between fermionic and multi-qubit systems, to simulate fermionic gates within multi-qubit systems.

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Multi-qubit quantum gates"

1

Flarend, Alice, et Bob Hilborn. « Quantum Circuits and Multi-Qubit Applications ». Dans Quantum Computing : From Alice to Bob, 135–58. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192857972.003.0010.

Texte intégral

Résumé :

The devices that carry out manipulations on qubit states are called quantum circuits, built from collections of quantum gates. Alice and Bob describe several two-qubit quantum gates and illustrate their actions on quantum states. They show that it is impossible to clone an unknown quantum state—the so-called No-Cloning Theorem. That theorem severely limits an eavesdropper’s ability to listen in on quantum communications without being detected. Alice and Bob then introduce and explain in detail two quantum communications algorithms: Superdense Coding (transmitting two bits of classical information with only one qubit) and Quantum State Teleportation (the ability to send enough information over a long distance to reconstruct a quantum state). Each of these applications highlights the book’s leitmotif of state preparation, state manipulation, and state measurement.

Styles APA, Harvard, Vancouver, ISO, etc.

2

Sengupta, Amlan, et Debotosh Bhattacharjee. « Quantum Program ». Dans Advances in Systems Analysis, Software Engineering, and High Performance Computing, 180–207. IGI Global, 2024. http://dx.doi.org/10.4018/978-1-7998-9522-0.ch006.

Texte intégral

Résumé :

The rapid evolution of quantum theory and technology has improved a lot in diverse fields. Quantum computing develops quantum-mechanical effects to execute a computation efficiently, and its benefits reduce both the execution duration and energy consumption compared to conventional computing. Recently, Google declared that quantum supremacy reached a maximum reach, and the quantum computer can effectuate an intractable calculation on a supercomputer. The different quantum algorithms implemented in quantum computers enhance efficiency and speed up the process with classical algorithms. The quantum software Qiskit is used to write quantum computing codes with different stages including building and execution stages. The single Qubit gates controlled two-bit gates and multi-controlled gates help identify the rotations of different dimensions of the plans. The three phenomena of quantum computing will be explained in detail on superposition, quantum measurement, and entanglement to evaluate its functioning.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Flarend, Alice, et Bob Hilborn. « Quantum Computing Algorithms ». Dans Quantum Computing : From Alice to Bob, 159–81. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192857972.003.0011.

Texte intégral

Résumé :

Alice and Bob introduce and explain in detail some of the algorithms that convinced physicists and computer scientists that there might be something to this crazy idea of quantum computing. Each algorithm provides a case study of how the properties of quantum states can be used to provide an advantage for using a quantum computer compared to a classical computer. Alice and Bob describe the Deutsch algorithm, designed to answer a simple question about the properties of functions of binary digits (0 and 1), and the Simon algorithm, which finds a “secret code.” The Simon algorithm, like many other quantum algorithms, is a mix of quantum state algorithms and classical computational methods. Alice and Bob also introduce Hadamard gates that act on multi-qubit systems. Those gates play an important role in many quantum algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

4

Nedunchezhian, Poornima, et Rajkumar Rajasekaran. « Introduction and Beginners Guide to Quantum Computing ». Dans Advances in Systems Analysis, Software Engineering, and High Performance Computing, 1–10. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-7998-9183-3.ch001.

Texte intégral

Résumé :

Quantum computing is a fascinating topic, and the authors attempt to give a detailed explanation about the history of quantum computing, double slit experiment, introduction about quantum computers, quantum super position, quantum entanglement, overview about quantum supremacy, building quantum computing, single bit gates, multi-bit gates, model of quantum computing with applications, and case study. The quantum computing was developed using quantum algorithms and quantum devices. Firstly, the quantum algorithms are developed as mathematical models, and the performance is evaluated through simulations, algebraic algorithms (cryptography, Diffie-Hellman, shor algorithm, for RSA) and amplitude amplification (database searching, pattern matching, etc.). Secondly, the quantum devices are the original physical devices built with optical connections instead of electrical connections. The qubit control uses the microwave for superconducting, laser, quantum dots, and photonics (optical instrument).

Styles APA, Harvard, Vancouver, ISO, etc.

5

Wereszczyński, Kamil, et Krzysztof Cyran. « Two-Rail Photonic Qubit Utilizing the Quantum Holographic Imaging Idea ». Dans Holography - Recent Advances and Applications [Working Title]. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.106889.

Texte intégral

Résumé :

We present the novel approach to physical implementation of qubits with the technology of photonic chips. Proposed multi-rail qubit model, called QBell, utilizes hyper-entanglement to work in Decoherence Free Subspace on physical layer. This makes this solution robust and can result in increasing fidelity of quantum circuit used in this model. We elaborate the two-rail case. We define the QBell and discuss its internal structure. We construct also one- and two-qubit gates to make the model comprehensive and ready to implement. Proposed model utilizes the early-stage ideas for optical quantum computation, but by using the polarization and position entanglement as the resource of computation allows to avoid the general problem of them, like heralded photon technique. The technology of photonic chips allows to brake other limitations that are pointed in the text. The presented model was inspired by quantum holographic imaging and uses the holographic technique for implementing the z-rotation operation. The final product will be the photonic quantum processor using multi-rail qubits. It will find the application in many domains (e.g., medical) on earth and in the space.

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Multi-qubit quantum gates"

1

S, Venugopal, et Kunwar Singh. « New Multi-Qubit CHSH Games and their application to Device-Independent Quantum Key Distribution protocols ». Dans 2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS), 1085–90. IEEE, 2025. https://doi.org/10.1109/comsnets63942.2025.10885575.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Ren, J., et X. Zhang. « Multi-qubit quantum phase gates based on plasmonic nanospheres ». Dans 2016 10th International Congress on Advanced Electromagnetic Materials in Microwaves and Optics (METAMATERIALS). IEEE, 2016. http://dx.doi.org/10.1109/metamaterials.2016.7746379.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

HOFMANN, HOLGER F., RYO OKAMOTO et SHIGEKI TAKEUCHI. « LOCALLY OBSERVABLE CONDITIONS FOR THE SUCCESSFUL IMPLEMENTATION OF ENTANGLING MULTI-QUBIT QUANTUM GATES ». Dans Proceedings of the 8th International Symposium. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812773210_0016.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Daraeizadeh, Sahar, Shavindra P. Premaratne et A. Y. Matsuura. « Designing high-fidelity multi-qubit gates for semiconductor quantum dots through deep reinforcement learning ». Dans 2020 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2020. http://dx.doi.org/10.1109/qce49297.2020.00014.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Toth, Peter, Lasse Cordes et Vadim Issakov. « A 13 GHz PA with Amplitude Modulation for Entanglement Generation in Multi-Qubit ¹⁷¹Yb⁺ Gates of an Ion-Trapped Quantum Computer ». Dans 2022 IEEE BiCMOS and Compound Semiconductor Integrated Circuits and Technology Symposium (BCICTS). IEEE, 2022. http://dx.doi.org/10.1109/bcicts53451.2022.10051697.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Ostrove, Corey, Stefan Seritan, Kenneth Rudinger, Matthew Grace, Erik Nielsen, Robin Blume-Kohout et Kevin Young. « Resource-efficient experiment designs for multi-qubit gate set tomography. » Dans Proposed for presentation at the Southwest Quantum Information and Technology Workshop 2022 held October 20-22, 2022 in Berkeley, California United States. US DOE, 2022. http://dx.doi.org/10.2172/2005704.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Jumayev, Bayram Ashyrmyradovich. « Modelling and testing multi-qubit universal control gate developed for quantum computing systems ». Dans CompSysTech '22 : International Conference on Computer Systems and Technologies 2022. New York, NY, USA : ACM, 2022. http://dx.doi.org/10.1145/3546118.3546139.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!