Image change detection using quantum computers

A quantum computer-based system efficiently detects image changes by constructing a quantum circuit with logarithmic loading and superposition principles, overcoming the inefficiencies of traditional methods and providing rapid, accurate image comparison.

JP2026539067APending Publication Date: 2026-11-19IONQ INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
JP2026525104
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-10-27
Filing Date
2024-10-24
Publication Date
2026-11-19

AI Technical Summary

Technical Problem

Existing image comparison methods are resource-intensive and time-consuming, particularly when dealing with large images, and struggle to account for complex structures like edges, limiting their efficiency and accuracy.

Method used

Utilizing a quantum computer with a quantum information processing system to detect changes between images by constructing a quantum circuit with auxiliary and image qubits, employing logarithmic loading and superposition principles to compare images efficiently, allowing for region-by-region change detection.

Benefits of technology

Enables rapid and accurate comparison of images with high resolution, reducing the need to individually compare every pixel, and effectively identifying significant changes by measuring top-level qubits, thus enhancing processing speed and efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2026539067000001_ABST
    Figure 2026539067000001_ABST
Patent Text Reader

Abstract

The aspects of this disclosure generally relate to systems and methods for detecting changes in images using quantum information processing (QIP) systems. [Solution] This method includes implementing a quantum circuit in a QIP system, the quantum circuit including at least an auxiliary qubit denoted as |a> and a qubit denoted as a condition for an image qubit on the |0> and |1> states of the auxiliary qubit |a>. This method also includes loading a reference image and a test image onto an image qubit controlled by the |0> and |1> states of the auxiliary qubit |a> in the quantum circuit. This method further includes determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times, and detecting that the reference image is different from the test image when the state of the auxiliary qubit is measured as |1>.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical Field]

[0001] This application claims the benefit and priority of U.S. Patent Nonprovisional Application No. 18 / 496,328, filed on 27 October 2023, the contents of which are incorporated herein by reference in their entirety.

[0002] The aspects of this disclosure generally relate to systems and methods for use in the implementation, operation, and / or use of quantum information processing (QIP) systems. [Background technology]

[0003] Trapped atoms are one of the primary implementations for quantum information processing or quantum computing. Atomic-based qubits can be used as quantum memory, as quantum gates in quantum computers and simulators, and as nodes for quantum communication networks. Qubits based on trapped atomic ions enjoy a rare combination of attributes. For example, qubits based on trapped atomic ions have very good coherence properties, can be prepared and measured with nearly 100% efficiency, and readily entangle with each other by modulating their Coulomb interactions in a suitable external control field such as an optical or microwave field. These attributes make atomic-based qubits attractive for extended quantum computing, such as quantum computing or quantum simulation.

[0004] Therefore, it is important to develop new technologies to improve the design, manufacture, implementation, control, or functionality, or combination thereof, of various QIP systems used as quantum computers or quantum simulators, particularly QIP systems that handle operations based on atom-based qubits. [Overview of the Initiative] [Problems that the invention aims to solve]

[0005] Below are simplified summaries of one or more embodiments to provide a basic understanding of them. These summaries are not intended to be a comprehensive overview of all intended embodiments, nor to identify the main or essential elements of all embodiments, nor to define the scope of any or all embodiments. Their sole purpose is to present some concepts of one or more embodiments in a simplified form, serving as a prelude to the more detailed explanations that will follow.

[0006] The aspects of this disclosure overcome the aforementioned problems and other shortcomings of this method.

[0007] This disclosure describes various aspects of techniques for detecting changes between two images (e.g., a reference image and a test image) using a quantum computer. [Means for solving the problem]

[0008] One aspect of the present disclosure describes a method for detecting changes between images. The method includes the step of constructing a quantum circuit in a QIP system, the quantum circuit including at least one auxiliary qubit denoted as |a> and placed in a uniform superposition state using an Adamard gate, and n qubits denoted as conditions for an image qubit on the |0> and |1> states of the auxiliary qubit |a>, where n corresponds to ceil(log2(N))+1 and N corresponds to the total number of pixels in the reference image, and the image qubit is divided into a first subset representing pixels of the image along the X axis and a second subset representing pixels along the Y axis. The method also includes the step of loading the reference image and test image onto the image qubit controlled by the |0> and |1> states of the auxiliary qubit |a> in the quantum circuit, such that pixels from the reference image and test image are read in superposition, after which another Adamard gate is added. Finally, the method includes the step of determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times in multiple copies of the constructed quantum circuit, and detecting that the reference image is different from the test image when the state of the auxiliary qubit measures |1>.

[0009] One aspect of this disclosure describes a system configured to detect changes in an image. The system comprises the steps of constructing a quantum circuit in a QIP system, the quantum circuit comprising at least one auxiliary qubit, denoted as |a>, which is placed in a uniform superposition state using a Hadamard gate, and n qubits, denoted as conditions for an image qubit, on the |0> and |1> states of the auxiliary qubit |a>, where n corresponds to ceil(log2(N))+1 and N corresponds to the total number of pixels in a reference image, and the image qubit is divided into a first subset representing pixels of the image along the X axis and a second subset representing pixels along the Y axis, and the pixels from the reference image and the test image are read in superposition. The system includes a change detection unit that controls one or more components of the QIP system to perform the following steps: loading a reference image and a test image onto an image qubit controlled by the |0> and |1> states of an auxiliary qubit |a> in a quantum circuit, wherein another Hadamard gate is added after the reference image and test image have been loaded onto the auxiliary qubit; and determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times in multiple copies of the quantum circuit, wherein it is detected that the reference image is different from the test image when the state of the auxiliary qubit is measured as |1>.

[0010] To achieve the aforementioned and related objectives, one or more embodiments shall have features that are fully described below and specifically indicated in the claims. The following description and accompanying drawings detail some exemplary features of one or more embodiments. However, these features represent only a few of the various ways in which the principles of the various embodiments may be employed, and this description shall include all such embodiments and their equivalents. [Brief explanation of the drawing]

[0011] The disclosed embodiments are described below, along with the accompanying drawings provided to be illustrative rather than limiting, and similar reference numerals indicate similar elements.

[0012] [Figure 1] Figure 1 shows a diagram of a linear crystal or chain of atomic ions according to an aspect of this disclosure. [Figure 2] Figure 2 shows an example of a quantum information processing (QIP) system according to an aspect of this disclosure. [Figure 3] Figure 3 illustrates an example of a computer device relating to an aspect of this disclosure. [Figure 4] Figure 4 shows an example of QPIXL coding for detecting changes in an image using a quantum computer according to an aspect of this disclosure. [Figure 5] Figure 5 shows an example of a linearly coupled unit (LCU) circuit for detecting changes in an image using a quantum computer, according to an aspect of this disclosure. [Figure 6] Figure 6 shows an example of an auxiliary measurement for detecting changes in an image using a quantum computer, according to an aspect of this disclosure. [Figure 7] Figure 7 shows an example of an image qubit measurement for detecting changes in an image using a quantum computer, according to an aspect of this disclosure. [Figure 8] Figure 8 shows an example of an output probability distribution for detecting image changes using a quantum computer according to an aspect of this disclosure. [Figure 9A] Figure 9A shows an example of an output probability distribution for detecting image changes using a quantum computer according to an aspect of this disclosure. [Figure 9B] Figure 9B shows an example of measuring a region that is not a power of 2 according to an aspect of this disclosure. [Figure 10] Figure 10 shows an example flowchart of an exemplary method for detecting changes in an image using a quantum computer, according to an aspect of this disclosure. [Figure 11] Figure 11 shows an example flowchart of an exemplary method for detecting changes in an image using a quantum computer, according to an aspect of this disclosure. [Mode for Carrying Out the Invention]

[0013] The detailed description set forth below with reference to the accompanying drawings or figures is intended as a description of various configurations or implementations, and is not intended to represent the only configuration or implementation in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details or with variations of these specific details. In some instances, well-known components are shown in block diagram form, and some blocks may represent one or more well-known components.

[0014] There can be many different reasons for wanting to detect changes between two images. As an example, in military applications, military satellites can perform reconnaissance by flying over enemy territory and taking aerial photographs of different terrain to locate enemy forces or track the movements of enemy forces. This can be accomplished by taking photographs of the same land at different time intervals to check if there are any differences in the photographs that can reveal information about the movement or position of enemy forces. In environmental applications, there may be satellites that capture images of a specific area (e.g., coral reefs, rainforests, etc.) and capture images of the same area at a later point in time to check if any changes have occurred. This helps detect climate anomalies and track environmental damage in specific areas. As another application, detecting changes between two images can be useful for face recognition purposes.

[0015] Quantum image processing is a method used to process images using quantum information technology. Quantum image processing ensures time-efficient management of simple operations used in classical image processing.

[0016] This disclosure describes detecting changes between two images using a quantum computer. The quantum computer includes a very large embedding space for rapidly and simultaneously manipulating these images. There are many advantages to using a quantum computer when detecting changes between two images. For example, a quantum computer can utilize a very large Hilbert space to encode image data and features within the image data. A Hilbert space is a mathematical representation of all possible states that a quantum system can take. Furthermore, a quantum computer can process large amounts of data in parallel using the principle of superposition. Superposition is the ability of a quantum system to be in multiple states simultaneously until its measurement.

[0017] As described herein, trapped atomic ions are an example of a quantum information processing approach that has provided a fully programmable machine. In trapped-ion QIPs, interactions can be realized naturally as an extension of general two-qubit gate interactions. Therefore, to implement interactions in trapped-ion techniques, it is desirable to use entangled gates for efficient (e.g., reduced number of gates) quantum circuit construction. One particular interaction available when using trapped ions for quantum computers is the so-called Mormar-Sorensen (MS) gate, also known as XX coupling or Ising gate. To achieve computational universality, Mormar-Sorensen gates (locally addressable or globally addressable) are complemented, for example, by arbitrary single-qubit operations.

[0018] Using these principles, the exemplary systems and methods described herein provide configurations for quantum circuits having multiple qubits that model cognitive interference effects. In particular, the systems and methods include applying a laser to an ion trap containing multiple qubits to set the probability of a single event by rotating at least one of the multiple qubits to fix the relative angle of at least one qubit. Furthermore, the quantum circuit is constructed by connecting multiple events, each containing a single event, such that the outcome of a single event determines whether the output of a subsequent event among the multiple events is more or less likely to occur. Furthermore, each of the multiple events then entangles multiple states representing various potential events, interfering with each other, including interference between at least two incompatible outcomes among the multiple events. In doing so, the quantum circuit can be configured to measure the outcome of each of the multiple events to model the result when a quantum computer determines the outcome of at least one of the multiple events, thereby eliminating possible outcomes for other events among the multiple events.

[0019] Solutions to the above-mentioned problems will be described in more detail with reference to Figures 1 to 11. Figures 1 to 3 provide a general disclosure of quantum information processing (QIP) systems or quantum computers, more specifically, atom-based QIP systems or quantum computers. Figures 4 to 9B provide an explanation and examples of detecting changes in an image using quantum circuits. Figures 10 to 11 provide flowcharts for detecting changes in an image using quantum circuits, relating to various exemplary embodiments of this disclosure.

[0020] Figure 1 shows a diagram 100 having multiple atomic ions or ions 106 (e.g., ions 106a, 106b, ..., 106c, and 106d) trapped within a linear crystal or chain 110 using traps (traps not shown in Figure 1 may be located in a vacuum chamber as shown in Figure 2). The traps may also be referred to as ion traps. The illustrated ion traps may be constructed or fabricated on a semiconductor substrate, a dielectric substrate, or a glass die or wafer (also referred to as a glass substrate). The ions 106 may be provided to the trap as atomic species for ionization and confinement within the chain 110. Some or all of the ions 106 may be configured to act as qubits in a QIP system.

[0021] In the example shown in Figure 1, the trap includes electrodes for trapping or confining multiple ions within a laser-cooled chain 110 to a near-static state. The number of ions to be trapped can be configurable, and more or fewer ions may be trapped. The ions are, for example, ytterbium ions (e.g., 171 Yb + It can be an ion. Ions are 171 Yb +The ions are irradiated with laser (light) radiation tuned to the resonance, and the fluorescence of the ions is imaged onto a camera or some other type of detection device (e.g., a photomultiplier tube or PMT). In this example, the ions may be separated from each other by only a few microns (μm), but this separation may vary depending on the architectural configuration. The separation of the ions is determined by the balance between the external confinement force and the Coulomb repulsion force and does not need to be uniform. Furthermore, in addition to ytterbium ions, barium ions, neutral atoms, Rydberg atoms, or other types of atom-based qubit techniques may also be used. Furthermore, ions of the same species, different species, and / or different isotopes may be used. The trap may be a linear RF pole trap, but other types of confinement devices, including optical confinement, may also be used. Thus, the confinement device may be based on a variety of techniques, for example, an ion trap may hold ions, neutral atoms, or Rydberg atoms, with ion traps being an example of such confinement devices. The ion trap may be, for example, a surface trap.

[0022] The chain 110 of ions 106 may be part of the QPU, that is, the chain 110 of ions 106 may be part of the processing engine or processing core of the QIP system. If any one of the ions 106 is connectable to any of the other ions 106 in the chain 110, the chain 110 is considered fully connected and is therefore usable to implement a fully connected QPU. Fully connected QPUs do not have to be limited to atom-based QIP systems.

[0023] Figure 2 shows a block diagram illustrating an example of a QIP system 200. The QIP system 200 may also be referred to as a quantum computing system, quantum computer, computer device, or trapped ion system. The QIP system 200 may be part of a hybrid computing system used to perform quantum computations and operations, which may also include a classical computer for performing classical computations and operations. Quantum and classical computations and operations can interact within such a hybrid system.

[0024] Figure 2 shows a general-purpose controller 205 configured to perform various control operations of the QIP system 200. These control operations may be performed by an operator, automated, or a combination of both. Instructions for at least some of the control operations may be stored in memory (not shown) within the general-purpose controller 205 and updated over time via a communication interface (not shown). Although the general-purpose controller 205 is shown separately from the QIP system 200, the general-purpose controller 205 may be integrated with the QIP system 200 or be part of the QIP system 200. The general-purpose controller 205 may include an automation and calibration controller 280 configured to perform various calibration, inspection, and automation operations related to the QIP system 200. These calibration, inspection, and automation operations may involve, for example, all or part of the algorithm unit 210, all or part of the optical and trap controller 220, and / or all or part of the chamber 250.

[0025] The QIP system 200 may include the algorithm unit 210 described above, which may work together with other parts of the QIP system 200 to execute or implement quantum algorithms, quantum applications, or quantum operations. The algorithm unit 210 may be used to execute or implement stacks or sequences of single-qubit operations and / or multi-qubit operations (e.g., 2-qubit operations), as well as extended quantum computations. The algorithm unit 210 may also include software tools (e.g., a compiler) to facilitate such execution or implementation. Thus, the algorithm unit 210 may directly or indirectly provide instructions to various components of the QIP system 200 (e.g., to the optical and trap controllers 220) to enable the execution or implementation of quantum algorithms, quantum applications, or quantum operations. The algorithm unit 210 may receive, process, and / or transfer information resulting from the execution or implementation of quantum algorithms, quantum applications, or quantum operations to another component of the QIP system 200 or another device (e.g., an external device connected to the QIP system 200) for further processing.

[0026] The QIP system 200 may include the optical and trap controller 220 described above. The optical and trap controller 220 controls various aspects of the trap 270 within the chamber 250, including generating signals to control the trap 270. The optical and trap controller 220 may also control the operation of the laser, optics, and optical components used to provide a light beam that interacts with atoms or ions in the trap. An optical system including multiple components may be called an optical assembly. The light beam is used to set the ions to perform or implement quantum algorithms, quantum applications, or quantum operations using the ions, and to read out the results from the ions. Controlling the operation of the laser, optics, and optical components may include dynamically changing operating parameters and / or configurations, including controlling positioning using motorized mounts or holders. When used to confine or trap ions, the trap 270 may be called an ion trap. However, the trap 270 may also be used to trap neutral atoms, Rydberg atoms, and other types of atom-based qubits. The laser, optical system, and optical components can be located at least partially within the optical and trap controller 220, the imaging system 230, and / or the chamber 250.

[0027] The QIP system 200 may include an imaging system 230. The imaging system 230 may include a high-resolution imaging device (e.g., a CCD camera) or other type of detection device (e.g., a PMT) for monitoring ions while ions are being supplied to the trap 270 and / or after ions have been supplied to the trap 270 (e.g., for reading out results). In one embodiment, the imaging system 230 can be implemented separately from the optics and trap controller 220, but the use of fluorescence for detecting, identifying, and labeling ions using image processing algorithms may necessitate coordination with the optics and trap controller 220.

[0028] In addition to the components described above, the QIP system 200 may include a source 260 that provides atomic species (e.g., a plume or flux of neutral atoms) to a chamber 250 having a trap 270. If atomic ions are the basis of quantum computation, the trap 270 confines the atomic species once it has been ionized (e.g., photoionized). The trap 270 may be part of what could be called the processor or processing portion of the QIP system 200. That is, the trap 270 can be considered the core of the processing computation of the QIP system 200, as it holds atom-based qubits used to perform or implement quantum computation or simulation. At least a portion of the source 260 may be implemented separately from the chamber 250.

[0029] It should be understood that the various components of the QIP system 200 shown in Figure 2 are described at a high level for ease of understanding. Such components may include one or more sub-components, the details of which may be provided below as necessary to better understand the particular aspects of this disclosure.

[0030] Aspects of the present disclosure may be implemented, at least in part, using one or more of the general-purpose controller 205, the automation and calibration controller 280, the optical and trap controller 220, and the chamber 250.

[0031] Referring here to Figure 3, an example of a computer system or device 300 is shown. The computer device 300 may represent, for example, a single computing device, multiple computing devices, or a distributed computing system. The computer device 300 may be configured to perform quantum computing (e.g., a QIP system), classical computing, or a combination of quantum and classical computing functions, which may also be called hybrid functions or operations. For example, the computer device 300 may be used to process information using quantum algorithms, classical computer data processing operations, or a combination of both. In one example, the results from one set of operations (e.g., a quantum algorithm) are shared with another set of operations (e.g., classical computer data processing). A common example of the computer device 300 implemented as a QIP system capable of performing quantum computation and simulation is, for example, the QIP system 200 shown in Figure 2.

[0032] The computer device 300 may include a processor 310 for performing processing functions associated with one or more of the features described herein. The processor 310 may include a single processor, multiple sets of processors, or one or more multi-core processors. Furthermore, the processor 310 may be implemented as an integrated processing system and / or a distributed processing system. The processor 310 may include one or more central processing units (CPUs) 310a, one or more graphics processing units (GPUs) 310b, one or more quantum processing units (QPUs) 310c, one or more intelligent processing units (IPUs) 310d (e.g., artificial intelligence or AI processors), or some or all of these types of processors. In one embodiment, the processor 310 may refer to a general-purpose processor of the computer device 300, and the computer device 300 may also include additional processors 310 for performing more specific functions (e.g., functions for controlling the operation of the computer device 300). Quantum operations may be performed by the QPU 310c. Some or all of the QPU310c may use atom-based qubits, but different QPUs may also be based on different qubit technologies. One or more of the QPU310c may be fully connected QPUs according to the embodiments of this disclosure.

[0033] The computer device 300 may include memory 320 for storing instructions that can be executed by the processor 310 to perform an operation. The memory 320 may also store data for processing by the processor 310 and / or data resulting from processing by the processor 310. In one implementation, for example, memory 320 may correspond to a computer-readable storage medium that stores code or instructions for performing one or more functions or operations. Similar to the processor 310, memory 320 may refer to the general memory of the computer device 300, and the computer device 300 may also include additional memory 320 for storing instructions and / or data for more specific functions.

[0034] It should be understood that the processor 310 and memory 320 may be used in connection with a variety of operations, including computing, calculation, simulation, control, calibration, system administration, and other operations of the computer device 300, including, but not limited to, any methods or processes described herein.

[0035] Furthermore, the computer device 300 may include a communications unit 330 that provides for establishing and maintaining communication with one or more entities using hardware, software, and services. The communications unit 330 may be used to perform communication between components on the computer device 300, as well as communication between the computer device 300 and external devices such as devices located across a communication network and / or devices serially or locally connected to the computer device 300. For example, the communications unit 330 may include one or more buses and further include transmit chain components and receive chain components associated with transmitters and receivers, respectively, which are capable of interfacing with external devices. The communications unit 330 may be used to receive updated information for the operation or functionality of the computer device 300.

[0036] Furthermore, the computer device 300 may include a data storage unit 340, which can be any suitable combination of hardware and / or software that provides mass storage for information, databases, and programs used in connection with the operation of the computer device 300 and / or any method or process described herein. For example, the data storage unit 340 may be a data repository for an operating system 360 (e.g., a classical OS, or a quantum OS, or both). In one implementation, the data storage unit 340 may include a memory 320. In one implementation, the processor 310 may run the operating system 360 and / or applications or programs, and the memory 320 or the data storage unit 340 may store them.

[0037] The computer device 300 may also include a user interface unit 350 configured to receive input from the user of the computer device 300 and to generate output for presentation to the user or to provide (directly or indirectly) to a different system. The user interface unit 350 may include one or more input devices, including but not limited to a keyboard, numeric keypad, mouse, touch-sensitive display, digitizer, navigation keys, function keys, microphone, voice recognition unit, any other mechanism capable of receiving input from a user, or any combination thereof. Furthermore, the user interface unit 350 may include one or more output devices, including but not limited to a display, speaker, haptic feedback mechanism, printer, any other mechanism capable of presenting output to a user, or any combination thereof. In one implementation, the user interface unit 350 may send and / or receive messages corresponding to the operation of the operating system 360. If the computer device 300 is implemented as part of a cloud-based infrastructure solution, the user interface unit 350 may be used to enable users of the cloud-based infrastructure solution to interact with the computer device 300 remotely.

[0038] In relation to the systems shown in Figures 1 to 3, techniques or methods for performing actions by using a quantum computer to detect changes in images are described. Quantum image processing techniques are primarily used for rapidly and accurately comparing two images. Furthermore, quantum computers can rapidly and simultaneously detect changes in images with extremely high resolution. Generally, it should be noted that exemplary quantum circuits configured to detect changes in images, as described herein, can be implemented using the QIP system 200 in Figure 2, in particular by configuring qubits in the trap 270. In other words, as described above, the trap 270 is at the core of the processing operation of the QIP system 200 and holds atomic-based qubits used to perform or implement quantum operations or simulations such as quantum circuits shown in Figures 4 to 9A and described in detail below, as well as methods and algorithms shown in Figures 10 to 11 and described below. In exemplary embodiments, the algorithm unit 210 can be configured to perform or implement stacks or sequences of combinations of single-qubit operations and / or multi-qubit operations (e.g., 2-qubit operations), as well as extended quantum operations for implementing the quantum operations in exemplary embodiments.

[0039] There are several ways to detect changes between two images. A classical method involves comparing every pixel individually to detect the change. However, this method is resource-intensive and time-consuming, as a 4K image can have nearly 4 million individual pixels. Alternatively, tools may be used to compare two images by using quantitative measures of similarity or dissimilarity. Commonly used measures include the mean squared difference between two images, the Pearson correlation coefficient of the observed image intensities of two images, and the entropy of the difference between two images. However, these methods cannot account for complex image structures such as edges.

[0040] This disclosure describes a technique for detecting changes in images using a QIP system by densely loading two images onto a quantum circuit using a logarithmic method. Since quantum computers utilize very large Hilbert spaces to encode image data and features within images, using a quantum computer to compare two images is advantageous. Furthermore, quantum computers can process large amounts of data in parallel using the superposition principle. Therefore, it is not necessary to compare every pixel individually, as in conventional methods of comparing images. Instead, only the top-level X and Y qubits may be measured, which provides region-by-region change detection up to a desired resolution.

[0041] Two images may be considered at once. The reference image may be the ground truth image, which is considered the baseline against which the test image is compared. The similarity between the two images is measured using a single scaler with values ​​constrained between 0 and 1. A value of 1 indicates that the two images (e.g., the reference image and the test image) are completely different from each other. A value of 0 indicates that the two images are identical.

[0042] In exemplary embodiments, the systems and methods described herein are configured to compare two images initially loaded into a quantization circuit (for example, by applying a laser to each ion in an ion trap, as described above for Figures 2 and 3) using an FRQI coding scheme implemented with the QPIXL algorithm within an LCU framework. The quantum states are retrospectively selected for auxiliary |1> states to ensure that there is a change between the images. The most significant qubit (e.g., up to the required resolution) is then measured to detect the region-by-region change, since only regions with change generate a large probability distribution.

[0043] Figure 4 shows an example of QPIXL coding for detecting changes in an image using a quantum computer according to an embodiment of the present disclosure. As described above, the exemplary quantum circuit can be implemented by a QIP system 200 according to an exemplary embodiment.

[0044] As shown in Example 400 of Figure 4, images (e.g., Image 1 and Image 2) can be densely loaded into quantum circuits 403a and 403b, respectively. In one embodiment, since the QPIXL algorithm is optimal in terms of the number of qubits and gates, the images may be loaded into the quantization circuit using FRQI (Flexible Representation of Quantum Images) coding implemented using the QPIXL (Quantum Image Representation) algorithm.

[0045] In general, FRQI encodes images for representation on a quantum computer. Specifically, FRQI provides a representation of an image on a quantum computer in the form of a normalized state that captures information about their corresponding positions and colors within the image. Once an FRQI state is achieved, a requested quantum image processing algorithm is applied to this state as required for its specific purpose of performing the entire process. After transformation, the FRQI state represents the classical image as a quantum image on the quantum computer in its normalized state. FRQI is used not only for image representation but also for various other related tasks in quantum image processing.

[0046] QPIXL generates circuits requiring fewer gates without introducing additional or auxiliary qubits. Furthermore, the QPIXL framework includes compression algorithms that further reduce gate complexity by up to 90% without significantly sacrificing quality. Implementations of the QPIXL algorithm are available as part of the Quantum Image Pixel Library (QPIXL++).

[0047] As shown in Example 400, the reference image may be laid out as shown in layout 401 of Image 1. Specifically, Image 1 is shown in layout 401 of Image 1 having 16 pixels. Pixel intensities are shown in smaller boxes within the image, with each small box representing one pixel. The pixels are read in superposition and represented by these bitstreams. Thus, for each bitstream, the bits represent pixel positions. Specifically, the label RY(θ 0000 ), RY(θ 0001 ), ···RY(θ 1111 ) are pixel intensities encoded using the angles of RY single-qubit rotations in Image 1. The labels are laid out so as to be represented as amplitudes of quantum states. Thus, in a quantum state (e.g., |1>), y1y0x1x0 represents the qubit states in the same order. In some embodiments, the qubit states are represented in little-endian order, storing the least significant byte at the smallest address.

[0048] In the FRQI representation, as shown in quantum state 405, Image 1 is stored in a state given by the following equation.

[0049] [Equation]

[0050] Here, θ encodes the color of the image, and |i> encodes the position of the pixel in the image.

[0051] As shown in Example 400, g K may represent a common pixel format such as a byte image, the number of which is stored as a value between 0 and 255. Typically, zero is black, 255 is white, and the values in between constitute various shades of gray.

[0052] Similarly, in layout 407 of Image 2, the images and labels are also laid out in the same manner as layout 401 of Image 1, except that the angles are RY(φ 0000 ), RY(φ 0001)···RY(φ 1111 It is expressed as ). Furthermore, quantum state 409 in image 2 is the same as quantum state 405 in image 1, except that θ is substituted with φ in order to represent image 2.

[0053] As shown in Example 400, h K This can represent a common pixel format, such as a byte image, and its number is stored as a value between 0 and 255. Typically, zero represents black, 255 represents white, and values ​​in between constitute various shades of gray.

[0054] The images (for example, Image 1 and Image 2) are each calculated as log2(N pixel )+1 allows for dense loading onto quantum circuits 403a and 403b. Therefore, in Example 400, five qubits are required to represent the entire image, where the pixel intensity is the angle of RY rotation of the auxiliary qubit indicated by a0. These qubits can be divided into two subsets: qubits (x0, x1) representing pixels along the x-direction (X qubits) and qubits (y0, y1) representing pixels along the y-direction (Y qubits).

[0055] After loading images into quantum circuits 403a and 403b, the quantum states (quantum state 405 and quantum state 409) are also shown. Specifically, these states are given by the angle θ of image 1 and the angle φ of image 2, with 405 of image 1 loaded into quantum circuit 403a and 411 of image 2 loaded into quantum circuit 403b.

[0056] The above example encodes a 16-pixel image with only 5 qubits, but it should be understood that images with any number of pixels can be used. For example, a 1024 x 1024 pixel image can be encoded with 20 qubits. In contrast, classical algorithms may require 1 million bits to encode a 1024 x 1024 pixel image. Therefore, by using quantum computers and logarithmic compression, encoding a 1024 x 1024 qubit image requires only 20 qubits.

[0057] Figure 5 shows an example of using an LCU circuit to detect changes in an image using a quantum computer, according to an aspect of this disclosure.

[0058] As shown in Example 500 of Figure 5, two images (e.g., a reference image and a test image) are simultaneously loaded onto the quantum circuit 501, as shown in Loading Image 1 509 and Loading Image 2 511. The advantage of this loading procedure is that instead of using 10 qubits to represent a 216-pixel image (5 qubits for Image 1 and 5 qubits for Image 2, as shown in the two quantum circuits in Figure 4), the loading procedure can use 5 qubits for Loading Image 1 509 and Loading Image 2 511 on a single quantum computer. The two images are encoded using an additional auxiliary qubit (a0). The additional auxiliary qubit 503, denoted as |a>, is placed in a uniform superposition state of 0s and 1s using the first Hadamard gate 505a. The two images 509, 511 are then encoded using log2(N) as the image qubit 507. pixel The image is loaded into )+1 qubits, which are conditioned on the |0> and |1> states of the auxiliary qubit |a>503, respectively. Another Hadamard gate 505b is added after the image has been loaded into auxiliary qubit 503, 509, 511. This procedure is known as the LCU algorithm.

[0059] The quantum state after applying the final Hadamard gate 505b is: The filename is TIFF2026539067000003.tif17169. Here, I1 and I2 represent two images encoded using the QPIXL algorithm loaded into image qubits (e.g., x0, x1, y0, y1). The |0> and |1> states in the above equation correspond to the auxiliary qubit (a). The quantum state before measuring the auxiliary qubit is |a>. The auxiliary qubit is then measured. If the two images are identical, the amplitude of the |1> state of the auxiliary qubit is 0. Therefore, if the |1> state occurs when measuring the auxiliary qubit, the two images are deterministically different, and a change has been detected. If the state |0> is measured, there is nothing deterministic, as the two images may be identical or different.

[0060] In one embodiment, there may be N copies of the quantum circuit, and the auxiliary qubit may be measured multiple times. In some examples, the number of measurements may be 10,000 times.

[0061] Figure 6 shows an example of an auxiliary measurement for detecting changes in an image using a quantum computer according to an aspect of this disclosure. Specifically, the state of the image qubit during the measurement of the auxiliary |1> state is shown in the quantum circuit 600.

[0062] The quantum circuit 600 in Figure 6 represents the probability of measuring the |1> state. For example, assume that the probability of measuring the |1> state, 607, is P1. Then, if the |1> state is not observed after N measurements, the probability of this is given by the following equation.

[0063]

number

[0064] Therefore, the number N of copies of the quantum circuit that should be created and measured to guarantee that the two images are identical with confidence δ is given by the following equation:

[0065]

number

[0066] If the |1> state is measured, the measurement process stops and further analysis of the image qubit is performed. The state of the image qubit after measuring |1> on the auxiliary qubit |a> is given by the following equation:

[0067]

number

[0068] The domain qubits (X and Y qubits, as shown in layout 401 in image 1 and layout 407 in image 2 of Figure 4) encode the state |i> in the above equation. In an example like the 16-pixel image layout shown in Figure 4, these states |i> correspond to |0000>, |0001>, |0010>, |0011>, ...|1111>. The amplitudes of these states are encoded on the auxiliary qubit 603, denoted by |a0>.

[0069] As seen in the above equation, the amplitudes of these states are encoded by the phase angle of the rotation gate that encodes the pixel intensity. Since the angle range is between 0 and π / 2, the value of the function is given by the following equation.

[0070]

number

[0071] The image qubit 609 is measured except for the auxiliary qubit |a0>. The probability of measuring state |i> is shown in Figure 8. When θ_i - φ_i ≈ 0, the amplitude of state |i> is very small. θ i -φ i The larger the value, the larger the amplitude. Therefore, pixels in two images with similar intensity have a probability of measuring state |i> of 0, and only very different pixels generate a high probability of measuring state |i>. To reiterate, state |i> encodes pixels within region |i> of two images, as shown in the image layout of Figure 4.

[0072] Figures 9A and 9B show exemplary output probability distributions where some of the states encoding pixels in different regions of an image have high probabilities. This means that there are significant changes between images in these regions. Other regions are suppressed, meaning that there are little changes in those regions. Therefore, detection of region-specific changes can be performed using the procedure described above.

[0073] After determining that there is a change between two images (for example, a reference image and a test image), additional analysis is required to determine exactly where within the image the change was detected.

[0074] Figure 7 shows an example of an image qubit measurement according to an aspect of this disclosure, which uses a quantum computer to detect where changes are occurring within an image.

[0075] Specifically, the quantum circuit 700 in Figure 7 precisely determines where a change is detected in the image by measuring the probability of measuring a specific state i on the four image qubits 709. For example, similar to the equation in Figure 6, the state of the image qubit 709 after measurement |1> 707 on the auxiliary qubit |a> 703 is given by the following equation.

[0076]

number

[0077] In particular, the formula for measuring the probability of measuring a specific state after measuring the image qubit 709 is as follows:

[0078]

number

[0079] If the compared pixels are different, that pixel is measured with an increasingly higher probability. This means that if the pixels between the two images are completely different, there are high probabilities of measuring this: 715, 717, 719, and 721. The principle is that we want to know where the images are most different, as we don't care about small changes.

[0080] Figure 8 shows an example of an output probability distribution for detecting image changes using a quantum computer according to an aspect of this disclosure.

[0081] Figure 8 shows an exemplary output probability distribution histogram of quantum circuit 800, where some of the states encoding pixels in different regions of the image have high probabilities. This suggests that there is significant variation between images in those regions. Other regions are suppressed, meaning that there is little variation in those regions.

[0082] For example, after measuring the probabilities of image qubits 815, 817, 819, and 821 N times, a probability histogram 823 may be generated. As shown in the probability histogram 823, only some bitstreams are shown, while others are not. This most likely indicates that the unshown bitstreams were identical because their probabilities were low or nonexistent. The shown bitstreams (e.g., 0000, 0010, 1000, 0110, 1011, 0001, 0111) indicate that these bitstreams were determined to be different. In one embodiment, bitstreams may be determined to be different by determining whether they exceed a predetermined threshold.

[0083] Figure 9A shows an example of an output probability distribution for detecting changes in an image using a quantum computer according to an aspect of the present disclosure. Specifically, Figure 9A shows a process for detecting region-by-region changes up to a desired resolution by measuring only a subset of image qubits.

[0084] It is not necessary to compare every pixel individually, that is, not to measure every state |i>. For example, an 8K image may have approximately 33 million pixels. Measuring all of these pixels is impractical. Rather, it is not necessary to measure every pixel; instead, only larger features are involved. This is easy to implement on a quantum computer because it is not necessary to measure all four image qubits 909. Instead, only the probabilities of the topmost X image qubit 907 and Y image qubit 909 may be measured, thereby providing region-by-region change detection up to the desired resolution. This is because the lower qubits follow along.

[0085] Example 900a shows an example where only the most significant X qubit xs1 and the most significant Y qubit y1 from quantum circuit 901 are measured. This yields an exemplary probability distribution.

[0086] The regions encoded by the measured qubits are shown in image layout 1911, indicated by thick dividing lines. Regions appearing in the probability distribution are also shown in the image layout. Therefore, the measurement of region qubits can only be performed up to the resolution necessary to detect changes between different regions of two images.

[0087] In other words, this is similar to dividing the image into four quadrants and measuring only X1 and Y1, and therefore equivalent to measuring the entire region 915. This is also why the probability histogram 913 shows only a 4-bit stream and not a 16-bit stream.

[0088] Based on probability histogram 913, the 01 region is said to have the highest probability and therefore the greatest change. This means that the 01 region should be the area of ​​interest because it has the highest probability, and the other regions can be discarded as they are most likely to have little change in those regions.

[0089] As an example, suppose a very large image is loaded onto a quantum circuit with 100X qubits and 100Y qubits. This process begins by measuring from the top (e.g., maximum X and maximum Y) and then dividing the image into four regions. Based on a predetermined probability threshold, regions 01 and 10 may be determined to pass the predetermined probability threshold, while regions 00 and 11 do not. If a region falls below the predetermined probability threshold, it may be discarded as there may be little change in that region. This leaves specific regions that pass the non-threshold as the target, and the next qubit to be measured. This further divides the region into four, and the process continues recursively until it is determined that the region size is less than a predetermined resolution.

[0090] In one embodiment, a predetermined resolution threshold may be set so that the process does not consider any minute differences between 256x256 resolutions. This means that if the baseline is 256x256, no measurements are taken for any qubits below the baseline. Instead, the region is scannable so that any changes made can be identified. In some examples, this may then be fed into a classical neural network for classification.

[0091] Figure 9B shows an example of measuring a region that is not a power of 2 according to an aspect of this disclosure.

[0092] The region encoded by the measured qubit is shown in layout 919 of Image 1, indicated by the thick dividing line. The region appearing in the probability distribution is also shown in layout 919 of Image 1. Therefore, the measurement of region qubits can only be performed up to the resolution required to detect changes between different regions of the two images.

[0093] Therefore, in order to measure the region that is not a fraction of 2, the base image can be periodically translated. The same procedure as described in Figure 9A is followed, and then the process branches again according to the region.

[0094] Figure 10 shows a flowchart illustrating a method for detecting changes in a region of an image. Specifically, Method 1000 in Figure 10 describes an overall flow process for detecting changes between two images using a quantum computer without comparing every pixel individually.

[0095] In step 1002, method 1000 may include loading a reference image and a test image onto a quantum circuit. Step 1002 is described in more detail in Figures 4 and 5. In step 1004, method 1000 may include measuring an auxiliary qubit and later selecting it as |1>. Step 1004 is described in more detail in Figure 6.

[0096] In step 1006, method 1000 may include determining whether the probability of |1> is greater than a threshold. If it is determined that the probability of |1> is not greater than a threshold, then in step 1016, method 1000 may include determining that the two images are identical up to a threshold. Step 1006 is described in more detail in Figures 6 and 7. If it is determined that the probability of |1> is greater than a threshold, method 1000 proceeds to step 1008.

[0097] The auxiliary measurement of |a> that gives state |1> confirms that the test image is different from the reference image. The image qubit measurement is intended to further determine which regions of the two images are different. In other words, if the auxiliary measurement of |a> gives state |1>, it clearly means that there is a difference between the two images, but there is not enough information to tell us where in the images the difference is. Therefore, the image qubit measurement further narrows down the region that has the difference.

[0098] In step 1008, method 1000 may include measuring the most significant X and Y image qubits.

[0099] In step 1010, method 1000 may include selecting a region having a probability greater than a threshold.

[0100] In step 1012, method 1000 may include determining whether the region size is larger than the required resolution. If it is determined that the region size is not larger than the required resolution, in step 1014, method 1000 may include discarding the measured qubit. If it is determined that the region size is larger than the required resolution, in step 1018, method 1000 may include detecting the region of change. Steps 1008, 1010, 1012, and 1014 are described in more detail in Figure 9A.

[0101] Figure 11 shows a flowchart illustrating a method for detecting changes in a region of an image.

[0102] In operation 1102, method 1100 may include implementing a quantum circuit in the QIP system, the quantum circuit comprising at least one auxiliary qubit denoted as |a> which is placed in a uniform superposition state using a Hadamard gate, and n qubits denoted as the conditions for an image qubit on the |0> and |1> states of the auxiliary qubit |a>, where n may correspond to ceil(log2(N))+1, and N corresponds to the total number of pixels in the reference image.

[0103] In operation 1104, method 1100 may include loading the reference image and the test image onto an image qubit controlled by the |0> and |1> states of an auxiliary qubit |a> in the quantum circuit, such that pixels from the reference image and the test image are loaded in superposition. After loading the reference image and the test image onto the auxiliary qubit, another Hadamard gate can be added. In one embodiment, the reference image and the test image may be loaded into the quantization circuit using the QPIXL (quantum pixel representation) algorithm. The image qubit may be divided into a first subset representing pixels of the image along the X axis and a second subset representing pixels along the Y axis. As an example, referring back to Figure 4, the image may include layout 401 of image 1 such that the image qubit is divided to represent pixels along the X axis and pixels along the Y axis.

[0104] As an example, referring back to Figure 5, the quantum circuit 501 may include an auxiliary qubit 503 (denoted as |a>) placed in a uniform superposition state of 0 and 1 using a first Hadamard gate 505a, and the two images 509 and 511 are then represented as image qubits 507 conditioned on the |0> and |1> states of the auxiliary qubit |a>503 respectively, log2(N pixel The image is loaded into )+1 qubits, and after the image is loaded into auxiliary qubit 503, 509 and 511, another Hadamard 505b gate is added.

[0105] In one embodiment, each pixel may include a bitstream representing the pixel intensity. In one embodiment, each pixel in the reference image and the test image may be labeled with a pixel intensity encoded as the angle of a single RY qubit rotation in the bitstream, so that a label is generated to represent the amplitude of the quantum state.

[0106] In operation 1106, method 1100 may include determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times on multiple copies of the implemented quantum circuit. The reference image may be detected to be different from the test image when the state of the auxiliary qubit is measured |1>.

[0107] As an example, referring back to Figure 6, the quantum circuit 600 measures the probability 607 of |1> on the auxiliary qubit 603, This is shown as in TIFF2026539067000010.tif19169. In addition, the probability of quantum circuit 600 measuring |1> on the auxiliary qubit |a> is shown by the following equation.

[0108]

number

[0109] Optionally, in operation 1108, method 1100 may include determining whether the probability of measuring the quantum state |i> after measuring the image qubit is greater than a probability threshold. The probability may correspond to a single scalar value between 0 and 1, where 1 indicates that the test image is different from the reference image, and 0 indicates that the test image is the same as the reference image.

[0110] As an example, referring back to Figure 6, the quantum circuit 600 shows the state of the image qubit after measuring |1> on the auxiliary qubit |a> as follows:

[0111]

number

[0112] In one embodiment, determining whether the probability of measuring a quantum state |i> after measuring an image qubit is greater than a probability threshold may further include measuring the probabilities of the top X image qubit from a first subset and the top Y image qubit from a second subset; selecting a region of a reference image having a measured probability greater than the probability threshold; for each selected region, determining whether the region size is greater than a predetermined resolution threshold for detecting changes between different regions of the reference image and the test image; and, based on the determination that the determined region size is greater than the predetermined resolution threshold, detecting that the test image is different from the reference image in the selected region.

[0113] As an example, referring back to Figure 9A, Example 900a shows a process for detecting region-by-region changes up to a desired resolution threshold by measuring only the most significant X qubit 907 and the most significant Y qubit 909.

[0114] In one embodiment, based on the determination that the probability is greater than a probability threshold, it is detected that the test image is different from the reference image; the probability of the highest X image qubit from a first subset and the highest Y image qubit from a second subset is measured; it is determined whether the size of the region generated from the highest X and Y image qubits is greater than a threshold for that region; based on the determination that the size of the region is greater than the threshold for that region, a narrowing procedure is performed, which includes determining whether the probability is greater than a probability threshold for that region; continuing to measure the next highest X image qubit from the first subset and the next highest Y image qubit from the second subset; and continuing to perform the narrowing procedure until it is determined that the size of the region is smaller than a predetermined resolution; and based on the determination that the probability of measuring a particular region is less than a threshold for that region, it is determined that a particular region is identical between the reference image and the test image up to a predetermined resolution threshold.

[0115] Optionally, in operation 1110, method 1100 may include detecting that the test image is different from the reference image based on a determination result that the probability is greater than a probability threshold.

[0116] In one embodiment, method 1100 may include detecting that a test image is identical to a reference image up to a predetermined resolution threshold, based on a determination result that the probability is less than or equal to a probability threshold.

[0117] In one embodiment, based on the determination that the selected region does not correspond to a fraction of a power of 2 of the test image, a function is executed that translates the reference image and the test image using periodic wrapping around the boundary between the reference image and the test image before loading the reference image and the test image into image qubits.

[0118] As an example, referring back to Figure 9B, Example 900b shows a process for measuring a region of an image that is not a power of 2 by performing periodic translation.

[0119] In one embodiment, method 1100 may include outputting an output probability distribution that represents a quantum state encoding pixels in different regions.

[0120] As an example, referring back to Figure 8, after measuring the probability N times, the probability histogram 823 may be output to indicate that the bitstreams shown in the probability histogram 823 (e.g., 0000, 0010, 1000, 0110, 1011, 0001, 0111) were determined to be different.

[0121] This disclosure provides techniques for detecting changes in an image without comparing every pixel individually, using a quantum computer. Furthermore, only the most important M X and Y qubits may be measured, which allows for region-by-region detection up to a desired resolution, as lower-order qubits can be discarded. The goal is to utilize these techniques described above to process large amounts of data in parallel using the superposition principle. In addition, quantum computers can encode image data and features within images by utilizing very large Hilbert spaces.

[0122] This disclosure describes a technique for detecting changes in a 16-pixel image, but it should be understood that this disclosure is not limited thereto. The techniques or methods described herein are also applicable to use with images having any number of pixels or resolution. This technique is particularly useful for extremely large images because the image is loaded onto the quantum circuit at high density.

[0123] The prior descriptions in this disclosure are provided to enable those skilled in the art to create or use this disclosure. Various modifications to this disclosure will be readily apparent to those skilled in the art, and the common principles defined herein may be applied to other modifications without departing from the scope of this disclosure. Furthermore, elements of the described embodiments may be described or claimed in the singular, but the plural is also assumed unless a limitation to the singular is expressly stated. Furthermore, all or part of any embodiment may be used in conjunction with all or part of any other embodiment unless otherwise stated. Accordingly, this disclosure should not be limited to the examples and designs described herein, but should be given the broadest scope that corresponds to the principles and novel features disclosed herein.

Claims

1. A method for detecting changes in an image using a quantum information processing (QIP) system, A step in constructing a quantum circuit in a QIP system, The aforementioned quantum circuit A Hadamard gate is used to place the system into a uniform superposition state, with at least one auxiliary qubit denoted as |a>, The auxiliary qubit |a> includes n qubits that are shown as conditions for an image qubit on the |0> state and |1> state, n is ceil(log 2 Corresponding to (N) + 1, N corresponds to the total number of pixels in the reference image, and the step, A step of loading the reference image and the test image onto an image qubit controlled by the |0> state and the |1> state of the auxiliary qubit |a> in the quantum circuit, such that pixels from the reference image and the test image are read in superimposition, After the reference image and test image are loaded onto the auxiliary qubit, another Hadamard gate is added. The image qubit is divided into a first subset representing the pixels of the image along the X-axis and a second subset representing the pixels along the Y-axis, A step of determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times, When the state of the auxiliary qubit is measured to |1>, it is detected that the reference image is different from the test image, step and A method that includes this.

2. A step of determining whether the probability of measuring the quantum state |i> after measuring the image qubit is greater than a probability threshold, The probability corresponds to a single scalar value between 0 and 1, such that 1 indicates that the test image is different from the reference image, and 0 indicates that the test image is the same as the reference image. The further step includes detecting that the test image is different from the reference image based on a determination result in which the probability is greater than the probability threshold. The method according to claim 1.

3. The further step includes detecting, based on the determination result that the probability is less than or equal to the probability threshold, that the test image is identical to the reference image up to a predetermined resolution threshold. The method according to claim 2.

4. The step of determining whether the probability of measuring the quantum state |i> after measuring the image qubit is greater than the probability threshold is: Measure the probability of the highest-ranking X image qubit from the first subset and the highest-ranking Y image qubit from the second subset, Selecting a region of the reference image having a measured probability greater than the aforementioned probability threshold, For each selected region, it is determined whether the region size is greater than a predetermined resolution threshold for detecting changes between different regions of the reference image and the test image. This includes detecting that the test image differs from the reference image in the selected region, based on the determination result that the determined region size is greater than the predetermined resolution threshold. The method according to claim 2.

5. A step of detecting that the test image is different from the reference image based on a determination result in which the probability is greater than the probability threshold, A step of measuring the probability of the highest-ranking X image qubit from the first subset and the highest-ranking Y image qubit from the second subset, The steps include determining whether the region size generated from the most significant X and Y image qubits is greater than the threshold for that region, A step in which a narrowing procedure is performed based on the determination result that the size of the region is greater than the threshold of that region, wherein the narrowing procedure is: Determining whether the probability is greater than the aforementioned probability threshold for that region, Continuing to measure the next highest-order X image qubit from the first subset and the next highest-order Y image qubit from the second subset, A step including continuing the execution of the narrowing procedure until it is determined that the size of the region is less than the predetermined resolution, The step further includes determining that a certain region is identical up to a predetermined resolution threshold between the reference image and the test image, based on the probability of measuring a certain region being less than a threshold for that region. The method according to claim 4.

6. Based on the determination that the selected region does not correspond to a fraction of the test image raised to the power of two, the step of executing a function that translates the reference image and the test image using periodic wrapping around the boundary between the reference image and the test image before loading the reference image and the test image into image qubits is further included. The method according to claim 4.

7. Each pixel contains a bitstream representing the pixel intensity. The method according to claim 1.

8. Each pixel in the reference image and the test image is labeled with a pixel intensity encoded as the angle of RY single-qubit rotation in the bitstream, and the labels are generated to represent the amplitude of the quantum state. The method according to claim 1.

9. The step further includes outputting an output probability distribution that represents the quantum state encoding pixels in different regions. The method according to claim 1.

10. The reference image and the test image are loaded into the quantum circuit using the QPIXL (quantum pixel representation) algorithm. The method according to claim 1.

11. The step of constructing the quantum circuit in the QIP system includes constructing the quantum circuit using atoms or ions in the traps of the QIP system. The method according to claim 1.

12. A quantum information processing (QIP) system that detects changes in an image, A step of constructing a quantum circuit in the QIP system, The aforementioned quantum circuit A Hadamard gate is used to place the system into a uniform superposition state, with at least one auxiliary qubit denoted as |a>, The auxiliary qubit |a> includes n qubits that are shown as conditions for an image qubit on the |0> state and |1> state, n is ceil(log 2 Corresponding to (N) + 1, N corresponds to the total number of pixels in the reference image, The image qubit is divided into a first subset representing pixels of the image along the X-axis and a second subset representing pixels along the Y-axis, in the step of... A step of loading the reference image and the test image onto an image qubit controlled by the |0> state and the |1> state of the auxiliary qubit |a> in the quantum circuit, such that pixels from the reference image and the test image are loaded in superposition, wherein another Hadamard gate is added after the reference image and the test image are loaded onto the auxiliary qubit. A step of determining the state of the image qubit after measuring |1> on the auxiliary qubit a predetermined number of times in multiple copies of the quantum circuit, wherein when the state of the auxiliary qubit is measured as |1>, it is detected that the reference image is different from the test image. The system includes a change detection unit that controls one or more components of the QIP system to perform the following actions: QIP system.

13. The aforementioned change detection unit A step of determining whether the probability of measuring the quantum state |i> after measuring the image qubit is greater than a probability threshold, The probability corresponds to a single scalar value between 0 and 1, such that 1 indicates that the test image is different from the reference image, and 0 indicates that the test image is the same as the reference image. A step of detecting that the test image is different from the reference image based on a determination result in which the probability is greater than the probability threshold. Further control one or more components of the QIP system to perform the following actions: The QIP system according to claim 12.

14. The aforementioned change detection unit Based on the determination result that the probability is less than or equal to the probability threshold, one or more components of the QIP system are further controlled to detect that the test image is identical to the reference image up to a predetermined resolution threshold. The QIP system according to claim 13.

15. The step of determining whether the probability of measuring the quantum state |i> after measuring the image qubit is greater than the probability threshold is: Measure the probability of the highest-ranking X image qubit from the first subset and the highest-ranking Y image qubit from the second subset, Selecting a region of the reference image having a measured probability greater than the aforementioned probability threshold, For each selected region, it is determined whether the region size is greater than a predetermined resolution threshold for detecting changes between different regions of the reference image and the test image. This includes detecting that the test image differs from the reference image in the selected region, based on the determination result that the determined region size is greater than the predetermined resolution threshold. The QIP system according to claim 13.

16. The aforementioned change detection unit A step of detecting that the test image is different from the reference image based on a determination result in which the probability is greater than the probability threshold, A step of measuring the probability of the highest-ranking X image qubit from the first subset and the highest-ranking Y image qubit from the second subset, The steps include determining whether the region size generated from the most significant X and Y image qubits is greater than the threshold for that region, A step in which a narrowing procedure is performed based on the determination result that the size of the region is greater than the threshold of that region, wherein the narrowing procedure is: Determining whether the probability is greater than the probability threshold for that region, Continuing to measure the next highest-order X image qubit from the first subset and the next highest-order Y image qubit from the second subset, A step including continuing the execution of the narrowing procedure until it is determined that the size of the region is less than the predetermined resolution, The step of determining that the region is identical up to the predetermined resolution threshold between the reference image and the test image, based on the fact that the probability of measuring a certain region is less than the threshold for that region. To perform the following, one or more components of the QIP system are further controlled: The QIP system according to claim 15.

17. Each pixel contains a bitstream representing the pixel intensity. The QIP system according to claim 12.

18. Each pixel in the reference image and the test image is labeled with a pixel intensity encoded as the angle of the RY single qubit rotation in the bitstream, and the labels are generated to represent the amplitude of the quantum state. The QIP system according to claim 12.

19. The aforementioned change detection unit Further control one or more components of the QIP system to output an output probability distribution that represents the quantum state encoding pixels in different regions. The QIP system according to claim 12.

20. A non-temporary computer-readable medium that stores executable instructions that map quantum program code to a multicore quantum computing system by being processed by a processor at runtime, wherein the processing is: A step of constructing a quantum circuit in the multicore quantum computing system, The aforementioned quantum circuit A Hadamard gate is used to place the system into a uniform superposition state, with at least one auxiliary qubit denoted as |a>, The auxiliary qubit |a> includes n qubits that are shown as conditions for an image qubit on the |0> state and |1> state, n is ceil(log 2 Corresponding to (N) + 1, N corresponds to the total number of pixels in the reference image, The image qubit is divided into a first subset representing the pixels of the image along the X-axis and a second subset representing the pixels along the Y-axis, in the step of... A step of loading the reference image and test image onto an image qubit controlled by the |0> state and the |1> state of the auxiliary qubit |a> in the quantum circuit, such that pixels from the reference image and test image are loaded in superposition, wherein another Hadamard gate is added after the reference image and test image are loaded onto the auxiliary qubit. A step of determining the state of the image qubit after measuring |1> a predetermined number of times on the auxiliary qubit in multiple copies of the constructed quantum circuit, wherein it is detected that the state of the auxiliary qubit is different from the reference image when |1> is measured. Non-temporary computer-readable media.