Gate-based Circuits Research Articles

Digital signature technique with quantum‐dot cellular automata

Quantum-dot cellular automaton (QCA) is efficient nanotechnology that may be used as an alternative to Complementary Metal Oxide Semiconductor technology. Here, computation relies upon the electron's polarisation, revealing binary information. Quantum-dot cellular automaton is an appropriate opportunity for the upcoming age of advanced digital frameworks. Security in transferring data is essential since a lot of valuable information is present. Digital Signature is a process where data is transferred from a receiver to an authenticated sender only. In this paper, tile-based Exclusive NOR gate (XNOR) is designed, which is more stable than the regular majority gate-based circuit. It is used to create a novel circuit for authentication of data which is based on tiles. It develops a QCA architecture that works on the principle of Digital Signature. The architecture validates and proves the authentication of the message sent from the sender to the receiver. The decrypted digest and the converted digest of the original dispatch are compared in the proposed Digital Validator circuit, which is developed utilising a QCA XNOR gate. The security for communication at the nanoscale level is enhanced due to the use of the SHA-256 algorithm. The simulation results confirm the theoretical results.

Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits

Quantum random walks, which drew much attention over the past few decades for their distinctly nonclassical behavior, are a promising subfield within quantum computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing coin quantum random walks using a Quantum Adder-based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit depth, gate count, connectivity requirements and scalability. We propose and analyze a novel approach to implementing boundary conditions for these walks, demonstrating the technique explicitly in one and two dimensions. Finally, we present several fidelity results from running our circuits on IBM’s quantum volume 32 ‘Toronto’ chip, showcasing the extent to which these noisy intermediate-scale quantum devices can currently handle quantum walks.

Relating Measurement Patterns to Circuits via Pauli Flow

The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends generalised flow to use the knowledge that some vertices are measured in a Pauli basis. In this paper, we show that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauli flow can be efficiently transformed into a gate-based circuit without using ancilla qubits. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus using a more circuit-like data structure we call the Pauli Dependency DAG.

Mitigating Realistic Noise in Practical Noisy Intermediate-Scale Quantum Devices

Quantum error mitigation (QEM) is vital for noisy intermediate-scale quantum (NISQ) devices. While most conventional QEM schemes assume discrete gate-based circuits with noise appearing either before or after each gate, the assumptions are inappropriate for describing realistic noise that may have strong gate dependence and complicated nonlocal effects, and general computing models such as analog quantum simulators. To address these challenges, we first extend the scenario, where each computation process, being either digital or analog, is described by a continuous time evolution. For noise from imperfections of the engineered Hamiltonian or additional noise operators, we show it can be effectively suppressed by a stochastic QEM method. Since our method assumes only accurate single qubit controls, it is applicable to all digital quantum computers and various analog simulators. Meanwhile, errors in the mitigation procedure can be suppressed by leveraging the Richardson extrapolation method. As we numerically test our method with various Hamiltonians under energy relaxation and dephasing noise and digital quantum circuits with additional two-qubit crosstalk, we show an improvement of simulation accuracy by 2 orders. We assess the resource cost of our scheme and conclude the feasibility of accurate quantum computing with NISQ devices.

Quantum computing with neutral atoms

The manipulation of neutral atoms by light is at the heart of countless scientific discoveries in the field of quantum physics in the last three decades. The level of control that has been achieved at the single particle level within arrays of optical traps, while preserving the fundamental properties of quantum matter (coherence, entanglement, superposition), makes these technologies prime candidates to implement disruptive computation paradigms. In this paper, we review the main characteristics of these devices from atoms / qubits to application interfaces, and propose a classification of a wide variety of tasks that can already be addressed in a computationally efficient manner in the Noisy Intermediate Scale Quantum\cite{Preskill_NISQ} era we are in. We illustrate how applications ranging from optimization challenges to simulation of quantum systems can be explored either at the digital level (programming gate-based circuits) or at the analog level (programming Hamiltonian sequences). We give evidence of the intrinsic scalability of neutral atom quantum processors in the 100-1,000 qubits range and introduce prospects for universal fault tolerant quantum computing and applications beyond quantum computing.

Pyruvate-responsive genetic circuits for dynamic control of central metabolism.

Dynamic regulation is a promising strategy for fine-tuning metabolic fluxes in microbial cell factories. However, few of these synthetic regulatory systems have been developed for central carbon metabolites. Here we created a set of programmable and bifunctional pyruvate-responsive genetic circuits for dynamic dual control (activation and inhibition) of central metabolism in Bacillus subtilis. We used these genetic circuits to design a feedback loop control system that relies on the intracellular concentration of pyruvate to fine-tune the target metabolic modules, leading to the glucaric acid titer increasing from 207 to 527 mg l-1. The designed logic gate-based circuits were enabled by the characterization of a new antisense transcription mechanism in B. subtilis. In addition, a further increase to 802 mg l-1 was achieved by blocking the formation of by-products. Here, the constructed pyruvate-responsive genetic circuits are presented as effective tools for the dynamic control of central metabolism of microbial cell factories.

Information-driven circuit synthesis with the pre-characterized gate libraries

The opportunities created by modern microelectronic technology cannot effectively be exploited, because of weaknesses in traditional circuit synthesis methods used in today's CAD tools. In this paper, a new information-driven circuit synthesis method is discussed that targets combinational circuits implemented with gates from the pre-characterized gate libraries. The method is based on our original information-driven approach to circuit synthesis, bottom up general functional decomposition and theory of information relationship measures. It differs considerably from all other known methods. The experimental results from the automatic circuit synthesis tool that implements the method demonstrate that the information-driven general decomposition produces very fast and compact gate-based circuits.