- Book Chapter
2
- 10.1016/b978-0-12-821982-9.00006-x
Chapter 5 - Quantum Algorithms and Methods
- Jan 01, 2021
- Quantum Information Processing, Quantum Computing, and Quantum Error Correction
- Ivan B Djordjević
Chapter 5 - Quantum Algorithms and Methods
In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit) cannot be copied, which is known as the non-cloning theorem. Second, when a qubit is measured, its superposition state collapses into a classical state, losing the inherent parallel information. In this paper, we overcome these challenges with runtime computation through ancilla qubits, which are used to indirectly collect the information of the qubits of interest. We design quantum circuits to assert classical states, entanglement, and superposition states. Our experimental results show that they are effective in debugging as well as improving the success rate for various quantum algorithms on IBM Q quantum computers.
Chapter 5 - Quantum Algorithms and Methods
Chapter 5 - Quantum Algorithms and Methods
Variational quantum machine learning with quantum error detection
Quantum machine learning (QML) is an emerging field that promises advantages such as faster training, improved reliability and superior feature extraction over classical counterparts. However, its implementation on quantum hardware is challenging due to the noise inherent in these systems, necessitating the use of quantum error correction (QEC) codes. Current QML research remains primarily theoretical, often assuming noise-free environments and offering little insight into the integration of QEC with QML implementations. To address this, we investigate the performance of a simple, parity-classifying Variational Quantum Classifier (VQC) implemented with the [[4,2,2]] error-detecting stabiliser code in a simulated noisy environment. To our knowledge, this is the first implementation of a stabiliser-based error detection code to a QML algorithm. We invoke ancilla qubits to logically encode rotation gates, and classically simulate the logically-encoded VQC under two simple noise models representing gate noise and environmental noise. We demonstrate that the stabiliser code improves the training accuracy at convergence compared to noisy implementations without error detection. However, we find that the effectiveness and reliability of error detection is contingent upon keeping the ancilla qubit error rates below a specific threshold, due to the propagation of ancilla errors to the physical qubits. Our results provide an important insight that extends to QML implemented with full error-correction: when the QEC code requires ancilla qubits for logical rotations but cannot fully correct errors propagated between ancilla and physical qubits, the maximum achievable accuracy of the QML model is constrained. This highlights the need for additional error correction or mitigation strategies to support the practical implementation of QML algorithms with QEC on quantum devices.
Read moreParametric Synthesis of Quantum Circuits for Training Perceptron Neural Networks
This work contains the analysis of results received after running synthesized quantum circuits for training perceptron neural networks. The training is performed by creating a Grover's algorithm with a custom oracle function. The concept of synthesizing quantum circuits was showcased in the process of generating training circuits for three perceptron topologies, which were designed to test the accuracy of the synthesis process. The test circuits serve to prove that the proposed synthesis approach could be scaled to utilize more complex quantum computing systems and to solve more practical tasks. IBM's 100-qubit cloud quantum simulator was used as the debugging environment. Quantum circuits for described algorithms are generated by the "Naginata" quantum synthesizer, its source code is published and further documented on GitHub along with the code for the provided example algorithms. The article describes the processes behind the algorithm for synthesizing quantum circuits that perform the training process of single-layer perceptrons by finding their weights by filtering all possible input values through a predefined accuracy criterion. Since quantum computing is still in its early development phase, quantum circuits are created mainly by manual placement of logic elements. Implementing quantum algorithms, especially more use-case specific ones, directly on the quantum circuit level could lead to the circuit easily becoming too complex for human comprehension. Quantum Circuit Synthesizer "Naginata" was created to simplify the development and debugging process of quantum algorithms, by adding better clarity to their development process. In our case, better clarity for the development process is achieved by composing functions for commonly used operations performed in the implemented quantum algorithm. The programmer could now implement the quantum algorithm as a set of functions, instead of manually creating a circuit from single logic elements. After this, the synthesizer would handle the task of creating the data for placing logic elements on the circuit. This enables an opportunity of implementing quantum algorithms with higher-level commands. In the scope of this work, parametrically generated generic blocks for frequently used operations such as: the adder, multiplier and digital comparator were created and utilized to form the training circuits. The test results, proved that with the help of the proposed quantum synthesizer, these compositions could be used efficiently as building blocks for implementing quantum algorithms. And by visually comparing sizes of both code and circuit representations of the synthesized circuits, to the code examples used to synthesize these circuits, it is determined that the proposed approach for implementing quantum circuits greatly simplifies the processes of development and debugging a quantum algorithm.
Read moreGrover algorithm circuit optimization and noise analysis on integer factorization
The classical computer is restricted by Moore's law and other factors into the development bottleneck, quantum computer by virtue of its natural acceleration advantage into the field of vision. Quantum computing can achieve the acceleration effect compared with classical computing in many fields. In the field of integer decomposition, Shor algorithm can be solved in polynomial time, which breaks the security of RSA public key cryptosystem. However, the quantum bits (logn + 2, where n is the integer to be decomposed) required by Shor algorithm are difficult to be realized on today's quantum computers. Therefore, the hybrid quantum algorithm model of "classical + quantum (Grover algorithm)" is tried to realize the decomposition of large integers. In this paper, based on the previous hybrid quantum algorithm model, considering that the continuous accumulation of errors in the circuit of the quantum algorithm will lead to the failure of the algorithm as the depth increases, part of the circuit of the quantum algorithm oracle is optimized to reduce the consumption of the depth, quantum gate and quantum bit in the circuit of the quantum algorithm, so as to make it easier to run on the actual quantum computer. By running the optimized quantum circuit on the back end of the simulator of IBM Q quantum cloud platform, and trying to add thermal relaxation and depolarization noises to the circuit, the influence of different noises on the circuit under different iterations was explored.
Read moreQuantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of quantum devices produced over a next decade. We introduce two separate ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. The first ingredient is a technique to recognize repeated patterns of quantum gates, opening up the possibility of future hardware optimization. The second ingredient is an approach to reduce circuit complexity by identifying zero- or low-amplitude computational basis states and redundant gates. As a demonstration, AQCEL is deployed on an iterative and effcient quantum algorithm designed to model final state radiation in high energy physics. For this algorithm, our optimization scheme brings a significant reduction in the gate count without losing any accuracy compared to the original circuit. Additionally, we have investigated whether this can be demonstrated on a quantum computer using polynomial resources. Our technique is generic and can be useful for a wide variety of quantum algorithms.
Read more6 Transforming animal agriculture through hybrid modeling and quantum computing
Quantum computing (QC) is not a futuristic notion in agriculture, though its full potential has yet to be realized. QC is an emerging field at the intersection of physics and computer science that holds immense potential to revolutionize various sectors, including agriculture production and artificial intelligence (AI) modeling. While QC is still in the early stages of development and practical applications within agriculture are not yet widespread, researchers are actively exploring its potential benefits in various agricultural domains, including crop optimization, livestock breeding, and environmental monitoring. QC harnesses the principles of quantum mechanics to perform computations using quantum bits or qubits, which can exist in multiple states simultaneously. Unlike classical computers, which rely on binary bits representing 0 or 1, quantum computers exploit phenomena such as superposition and entanglement to process information in parallel, potentially offering exponential speedup for certain types of problems. In agriculture production, particularly in animal science, QC offers promising avenues for optimizing processes and enhancing productivity. Quantum algorithms can analyze vast amounts of genomic data to improve breeding programs, leading to the development of more resilient and productive livestock breeds. Furthermore, QC can facilitate precision farming techniques by modeling complex environmental factors and animal behavior to optimize feeding strategies, disease management, and overall farm management practices. Moreover, QC can significantly benefit AI modeling by accelerating computations and enabling more efficient training of AI models. Quantum algorithms can enhance the performance of AI algorithms in various tasks, including pattern recognition, natural language processing, and predictive analytics. By leveraging quantum-enhanced optimization algorithms, AI models can achieve better convergence and accuracy, leading to more effective decision-making and problem-solving capabilities. While hybrid intelligent models also represent a novel frontier in agriculture, QC has the potential to expedite the merging of mechanistic and AI modeling paradigms, facilitating a more holistic understanding of complex systems in agriculture and beyond. By integrating mechanistic models, which describe the underlying physical processes, with AI models, which learn patterns from data, quantum computing can enable comprehensive simulations and predictions of agricultural systems. This fusion of modeling paradigms can lead to more accurate and robust predictions of crop yields, livestock performance, and environmental impacts, facilitating informed decision-making for farmers and policymakers. The application of QC in agriculture, however, requires interdisciplinary collaborations between physicists, computer scientists, agronomists/animal scientists, and AI researchers. These collaborations can drive the development of quantum algorithms tailored to agricultural applications, the integration of quantum-enhanced AI techniques into existing modeling frameworks, and the deployment of QC resources in real-world agricultural systems. Ultimately, harnessing the power of QC holds the potential to revolutionize agriculture production practices, including regenerative agriculture, and advance AI modeling capabilities, paving the way for a more sustainable and efficient agricultural industry.
Read moreAn Overview of Different Approaches for Ternary Reversible Logic Circuits Synthesis Using Ternary Reversible Gates with Special Reference to Virtual Reality
Quantum computing has been projected as an alternative to classical computing and promises to offer feasible solutions to problems that are considered intractable today. It has also been observed that information storage, processing, and communication can be improved to a great extent by the use of quantum mechanical effects like non-classical correlation and superposition of states. In a reversible circuit, we have a cascade of reversible gates each of which carry out some bijective mapping between inputs and outputs. They are also structurally different from conventional circuits in the sense that fanout and feedback connections are not permitted. In a binary quantum system expressed as a quantum circuit, the number of circuit lines represent the basic unit of information being processed (called quantum bits or qubits). Specifically, qutrit is the unit of information for a three-valued quantum system and is represented in one of the states such as \(|0\rangle \), \(|1\rangle \), and \(|2\rangle \). As we know, qutrits are very much expensive resources in the synthesis process, and thus reducing the number of qutrits plays a major role during synthesis. The idea behind this work is to make the early researchers in this specific area to get a comprehensive understanding of ternary reversible logic synthesis. Hence, this work addresses the different ternary reversible logic synthesis approaches and thus allow the researchers to gain more knowledge about the process of ternary reversible logic synthesis in an efficient manner and also gives an insight of how quantum computing can be further explored in the broad area of augmented reality and virtual reality.KeywordsQutritsReversible logicSynthesisTernary reversible gates
Read moreLow rank approximation in simulations of quantum algorithms
Low rank approximation in simulations of quantum algorithms
Motion Planning Algorithms for Safety and Quantum Computing Efficiency
Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.
Read moreBinary Tree Block Encoding of Classical Matrix
State preparation and block-encoding are essential subroutines in quantum computing. The former provides basic encoding of quantum states, while the latter transforms classical data into a matrix representation within a quantum circuit. Some quantum advantages are built on the assumption that the subroutine– block encoding has been compiled in the quantum circuit, and this derives a problem of how to efficiently compile a block encoding. The resource trade-offs of block encoding, such as circuit size, subnormalization factor, compilation complexity (both time and space), and robustness against errors are central to its efficiency. In this work, the Binary Tree Block-Encoding (BITBLE) protocol is introduced, which optimizes these trade-offs. For a classical matrix in C<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2n× 2n</sup>, our approach reduces the compilation time to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i>(n2<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2n</sup>) using n ancilla qubits, achieving superior resource trade-offs compared to existing methods. Numerical experiments further reveal that the approach outlined in BITBLE enhances compilation efficiency, resource scalability, and robustness against single-qubit gate errors in various standard data encoding tasks. Moreover, all algorithms are available as open-source.
Read moreQuantum Computing: Foundational and Theoretical Models
Quantum computing is a multidisciplinary field at the intersectionof quantum physics, computer science, and mathematics, aiming to har-ness quantum mechanical phenomena for computational advantage. Thisarticle provides a comprehensive review of both the foundational princi-ples and advanced theoretical models of quantum computing. We beginwith the basic framework of quantum computation, introducing the con-cept of qubits as two-level quantum systems, the linear algebra of Hilbertspaces, Dirac’s bra–ket notation, and the postulates of quantum mechan-ics (state superposition, unitary evolution, and projective measurement).We then discuss quantum logic gates and circuits, highlighting how clas-sical reversible computation principles extend to universal quantum gatesets. Next, we survey key quantum algorithms (from Shor’s factoring toGrover’s searching and beyond) and the complexity-theoretic implicationsof quantum computers, contrasting the class BQP with classical complex-ity classes. We cover the theoretical foundations of quantum error cor-rection and fault tolerance, explaining how quantum information can beprotected from decoherence using redundancy and how fault-tolerant pro-tocols can, in principle, allow scalable quantum computation despite noisyhardware. We then explore advanced models and paradigms of quantumcomputation, including measurement-based quantum computing (one-wayquantum computing), topological quantum computation with anyons, adi-abatic quantum computing and quantum annealing, continuous-variablequantum computing, and related approaches. We also provide an overviewof quantum information theory as it relates to computation, discussingentanglement, quantum entropy, and information-theoretic limits like theHolevo bound. Finally, we review the leading physical implementations(quantum hardware models) of quantum computers—trapped ions, super-conducting circuits, photonic systems, solid-state spin qubits, and oth-ers—outlining the challenges and achievements of each approach.
Read moreQuantum computing with qubits made from electrons on a helium film
A quantum computer based on the manipulation and detection of coherent states of electrons localized above a helium film is described. Each quantum logic element (qubit) is made of a combination of the ground and first excited states of an electron trapped in the image potential well at the surface. Potentials applied to micro-electrodes located beneath each electron confine the lateral motion of the electron and are used to operate gates. Mechanisms for one- and two-qubit logic operations and a readout of the final state are discussed. The principle decay channel for the excited state is via the emission of one phonon into the bulk liquid. Dechoherence times are calculated to be of order of 100 μs and allow greater than 10<sup>4</sup> serial operations.
Read morePlanar weibull quantum circuit genetic algorithm with strong search ability and its implementation
Genetic Algorithm (GA) is a widely used search method, and Quantum Genetic Algorithm (QGA) has been pointed out for several years. While common QGA only refers to the concept of quantum mechanics, and still uses mathematical representations of quantum states to simulate quantum entanglement and superposition, it can’t be realized on a quantum computer. This paper presents an implementable quantum circuit for a genetic algorithm, named as Planar-Weibull Quantum Circuit Genetic Algorithm (PW-QCGA), employing the Weibull function and excitation function through planar matrix coding. It is not only a self-adaptive algorithm that adjusts parameters dynamically, but it can also be executed on quantum computers by constructing parameterized quantum circuits. Experiments on three typical applications show that PW-QCGA not only has obvious advantages on convergence accuracy, search ability, convergence speed, and robustness, but also has higher fidelity on a quantum computer. We hope this work can bring inspiration to other quantum intelligent algorithms.
Read moreNobel Symposium 141: Qubits for Future Quantum Information
Quantum mechanics is the most ground-breaking and fascinating theoretical concept developed in physics during the past century. Much of our present understanding of the microscopic world and its extension into the macroscopic world, including modern technical applications, is based upon quantum mechanics. We have experienced a remarkable development of information and communication technology during the past two decades, to a large extent depending upon successful fabrication of smaller and smaller components and circuits. However, we are finally approaching the physical limits of component miniaturization as we enter a microscopic world ruled by quantum mechanics.
Read moreState Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry.
State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space-unitary coupled cluster (LAS-UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. In this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C-C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.
Read more