Abstract: Systems and methods for pixel-based quantum state visualization are disclosed. In one embodiment, a computer-based method for generating a visualization of a quantum state may include: (1) receiving, at a computer program executed by a computer processor, quantum input data comprising a plurality of outcomes for a quantum state, each outcome having a phase and a magnitude; (2) for each outcome, translating, by the computer program, the outcome into a pixel having a hue based on the phase and an intensity based on the magnitude; (3) plotting, by the computer program, the pixel on a pixel graph; and (4) outputting, by the computer program, the pixel graph to an output device.

Abstract: A method for solving a problem using a quantum oracle may include a classical computer program: selecting an implementation for a problem from one or more different implementations in a dictionary of implementations; preparing the implementation using bounds on a quantum circuit to solve the problem and encoding input data for the problem into a quantum state; selecting an oracle to monitor and measure the quantum state based on the implementation, wherein the oracle identifies a pattern of interest in the quantum state; transpiling the prepared implementation and the oracle into a set of machine-readable instructions; sending the set of machine-readable instructions to a quantum computer, wherein the quantum computer executes the set of machine-readable instructions and returns an array of results, the array of results representing measurements of the quantum state using the oracle; and analyzing the array of results and outputting the analysis.

Abstract: Systems and methods for using distributed quantum-based computing simulators are disclosed. In one embodiment, a method may include: (1) receiving, at a driver node and from a service, a set of operations and a location for each operation compiled from a set of quantum computing instructions provided by a client device; (2) generating, by the driver node, a declarative instantiation plan for the set of operations identifying a plurality of worker nodes, each worker node corresponding to one of the locations; (3) instantiating, by the driver node, the declarative instantiation plan; (4) issuing, by the driver node, the operations to the worker nodes based on the locations for each operation; (5) receiving, by the driver node, results from each worker node; (6) aggregating, by the driver node, the results; and (7) returning, by the driver node, the aggregated results to the client device via the service.

Abstract: A method for optimized quantum searching may include: creating a quantum circuit that implements Grover's algorithm; in a pre-transpile step, instances of Hadamard (H) gates around application of an oracle in the quantum circuit; identifying a number of 1s in a target state and a number of qubits required for the target state; calculating a value ?max based on the values n and k; deriving a value ?max from ?max; calculating a value jideal using the value ?max and a value ?ideal using jideal; determining an optimal angle ?; replacing the instances of the H gates before the oracle with H Z RY(?) gates, and the instances of the H gates after the oracle with RY(?) Z H gates; completing transpiling the quantum circuit into a plurality of quantum instructions; sending the quantum instructions to a quantum computer; and receiving results of execution of the quantum instructions.

Abstract: A method for optimized quantum searching may include: creating, by a classical computer program, a quantum circuit that implements Grover's algorithm; identifying, by the classical computer program in a pre-transpile step, instances of Hadamard gates (H gates) and Pauli X-gates (X gates) and instances of X gates and H gates in the quantum circuit; replacing, by the classical computer program, the instances of the H gates and X gates with Rx(?/2) gates and the instances of the X gates and H gates with Rx(??/2) gates; implementing, by the classical computer program, a plurality of gates that implement a reflection about the mean in the quantum circuit; completing, by the classical computer program, transpiling the quantum circuit into a plurality of quantum instructions; sending, by the classical computer program, the quantum instructions to a quantum computer; and receiving, from the quantum computer, results of execution of the quantum instructions.

Abstract: Systems and methods for pixel-based quantum state visualization are disclosed. In one embodiment, a computer-based method for generating a visualization of a quantum state may include: (1) receiving, at a computer program executed by a computer processor, quantum input data comprising a plurality of outcomes for a quantum state, each outcome having a phase and a magnitude; (2) for each outcome, translating, by the computer program, the outcome into a pixel having a hue based on the phase and an intensity based on the magnitude; (3) plotting, by the computer program, the pixel on a pixel graph; and (4) outputting, by the computer program, the pixel graph to an output device.