The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]
Most of the architectural research on photonic implementations of measurement-based quantum computing (MBQC) has focused on the quantum resources involved in the problem with the implicit assumption that these will provide the main constraints on system scaling. However, the “flying-qubit” architecture of photonic MBQC requires specific timing constraints that need to be met by the […]
Operating semiconductor quantum dots as quantum bits requires isolating single electrons by adjusting gate voltages. The transitions of electrons to and from the dots appear as a honeycomb-like pattern in recorded charge stability diagrams (CSDs). Thus, detecting the pattern is essential to tune a double dot, but manual tuning is seriously time-consuming. However, automation of […]
The advent of noisy intermediate-scale quantum (NISQ) devices provide crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous variational quantum eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish […]
Experimental demonstrations of quantum annealing with “native” implementation of Boolean logic Hamiltonians are reported. As a superconducting integrated circuit, a problem Hamiltonian whose set of ground states is consistent with a given truth table is implemented for quantum annealing with no redundant qubits. As examples of the truth table, nand and nor are successfully fabricated […]
Existing drug discovery pipelines take 5–10 years and cost billions of dollars. Computational approaches aim to sample from regions of the whole molecular and solid-state compounds called chemical space, which could be on the order of 1060. Deep generative models can model the underlying probability distribution of both the physical structures and property of drugs and […]
As each quantum algorithm requires a specific initial quantum state, quantum state preparation is an important task in quantum computing. The preparation of quantum states is performed by a quantum circuit consisting of controlled-NOT (CNOT) and single-qubit gates. Known algorithms to prepare arbitrary n -qubit quantum states create quantum circuits in O(2n) runtime and use O(2n) CNOTs, which are more expensive […]
Entangled photons can be used to create a truly secure communication link between two parties. However, the distance over which this can be achieved is limited by the transmission losses associated with optical fibers. One potential solution is using quantum repeaters (QRs) where initial entanglement is created over short distances and then extended via entanglement […]
The Quantum Scientific Computing Open User Testbed (QSCOUT) at Sandia National Laboratories is a trapped-ion qubit system designed to evaluate the potential of near-term quantum hardware in scientific computing applications for the U.S. Department of Energy and its Advanced Scientific Computing Research program. Similar to commercially available platforms, it offers quantum hardware that researchers can […]
In quantum computing the decoherence time of the qubits determines the computation time available, and this time is very limited when using current hardware. In this article, we minimize the execution time (the depth) for a class of circuits referred to as linear reversible circuits, which has many applications in quantum computing (e.g., stabilizer circuits, […]