WO2011071282A1 - Table de karnaugh quantique - Google Patents

Table de karnaugh quantique Download PDF

Info

Publication number
WO2011071282A1
WO2011071282A1 PCT/KR2010/008656 KR2010008656W WO2011071282A1 WO 2011071282 A1 WO2011071282 A1 WO 2011071282A1 KR 2010008656 W KR2010008656 W KR 2010008656W WO 2011071282 A1 WO2011071282 A1 WO 2011071282A1
Authority
WO
WIPO (PCT)
Prior art keywords
quantum
gates
circuit
sub
karnaugh map
Prior art date
Application number
PCT/KR2010/008656
Other languages
English (en)
Inventor
Doyeol Ahn
Original Assignee
University Of Seoul Industry Cooperation Foundation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by University Of Seoul Industry Cooperation Foundation filed Critical University Of Seoul Industry Cooperation Foundation
Priority to JP2012543022A priority Critical patent/JP5537669B2/ja
Publication of WO2011071282A1 publication Critical patent/WO2011071282A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/30—Circuit design
    • G06F30/32—Circuit design at the digital level
    • G06F30/33—Design verification, e.g. functional simulation or model checking
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B82—NANOTECHNOLOGY
    • B82Y—SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES
    • B82Y10/00—Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena

Definitions

  • This invention relates to a Karnaugh map, and more specifically, this invention relates to a quantum Karnaugh map.
  • Quantum information science concerns the information science that depends on quantum effects in physics. It includes theoretical issues in computational models as well as more experimental topics in quantum physics including what can and cannot be done with quantum information. In such quantum information science, significant efforts have been directed towards various physical implementations of quantum bits and quantum circuits.
  • a quantum circuit is a model for quantum computation in which a computation is a sequence of reversible transformations on a quantum mechanical analog of an n bit register.
  • a Karnaugh map has been used as an efficient method for a logic design.
  • the representation of the quantum state evolution in Hilbert space by classical Boolean algebra is not quite straightforward, and thus an efficient design of universal quantum circuits may not be facilitated with a general Karnaugh map.
  • a computing device configured to determine a quantum Karnaugh map corresponding to a quantum circuit.
  • the computing device includes a decomposer configured to decompose a quantum circuit into a multiple number of sub-circuits, a first logic unit configured to receive possible inputs of each sub-circuit, and determine corresponding outputs of each sub-circuit in response to the received possible inputs to obtain input/output relation of each sub-circuit, a second logic unit configured to construct a sub-quantum Karnaugh map corresponding to each sub-circuit based on the input/output relation of each sub-circuit, and a third logic unit configured to obtain a product of entries in the same position of each sub-quantum Karnaugh map to determine a quantum Karnaugh map corresponding to the quantum circuit.
  • Each of the multiple number of sub-circuits can include single qubit gates and C-NOT gates.
  • a computing device configured to design a quantum circuit.
  • the computing device includes a first module configured to group entries other than identity (I) entries in a quantum Karnaugh map into one or more rectangular groups, and to determine a multiple number of sets of rectangular groups, a second module configured to determine a plurality of quantum circuits corresponding to the quantum Karnaugh map based on the multiple number of sets of rectangular groups, a third module configured to determine the number of single qubit gates and C-NOT gates required for each of the multiple number of quantum circuits, and a selector configured to select a quantum circuit having aminimum number of single qubit gates and C-NOT gates among the multiple number of quantum circuits.
  • Each of the rectangular groups is comprised of neighboring entries, and the number of the neighboring entries of each rectangular group is 2 n (n is an integer equal to or greater than zero).
  • the first module can be further configured to determine the multiple number of sets of rectangular groups for each sequence of control qubits of the quantum Karnaugh map.
  • the minimum number of single qubit gates and C-NOT gates can be determined based on the following equation:
  • m is the number of control qubits
  • Q(m/2) is a quotient of m/2
  • R(m/2) is a remainder of m/2
  • N m is the minimum number of single qubit gates and C-NOT gates.
  • the computing device may be implemented as a portion of a small-form factor portable electronic device or a personal computer.
  • a method for designing a quantum circuit implemented on a computing device includes receiving entries other than identity (I) entries in a quantum Karnaugh map to group into one or more rectangular groups, and determining a multiple number of sets of rectangular groups, determining a plurality of quantum circuits corresponding to the quantum Karnaugh map based on the plurality of sets of rectangular groups, determining the number of single qubit gates and C-NOT gates required for each of the plurality of quantum circuits, and selecting a quantum circuit having the minimum number of single qubit gates and C-NOT gates among the plurality of quantum circuits.
  • Each rectangular group is comprised of neighboring entries, and the number of the neighboring entries of each rectangular group is 2 n (n is an integer equal to or greater than zero).
  • the multiple number of sets of rectangular groups can be determined for each sequence of control qubits of the quantum Karnaugh map.
  • m is the number of control qubits
  • Q(m/2) is a quotient of m/2
  • R(m/2) is a remainder of m/2
  • N m is the minimum number of gates.
  • a storage medium device having computer readable instructions embodied therewith.
  • the computer readable instructions when executed on a computing device cause the computing device to perform the aforementioned method.
  • FIG. 1 shows a schematic of selected components of an illustrative embodiment of a computing device configured to determinea quantum Karnaugh map corresponding to a quantum circuit.
  • FIG. 2 shows a schematic of an illustrative embodiment of the processing of one example quantum circuit by the computing device shown in FIG. 1.
  • FIG. 3 shows a schematic of selected components of an illustrative embodiment of a computing device configured to design a quantum circuit based on a quantum Karnaugh map.
  • FIG. 4 shows schematics of examples of the quantum Karnaugh map shown in FIG. 3.
  • FIGS. 5(a) and 5(b) show schematics of a C 2 (X) gate and its decomposed structure.
  • FIG. 6 shows a graph illustrating the minimum number of single qubit gates and C-NOT gates required to construct a quantum circuit for a C m (X) gate using the computing device of FIG. 3.
  • FIG. 7 is a block diagram illustrating an example computing device that is configured in accordance with the present disclosure.
  • a computing device configured to determine a quantum Karnaugh map corresponding to a quantum circuit.
  • the computing device includes a decomposer configured to decompose a quantum circuit into a multiple number of sub-circuits, a first logic unit configured to receive possible inputs of each sub-circuit, and determine corresponding outputs of each sub-circuit in response to the received possible inputs to obtain input/output relation of each sub-circuit, a second logic unit configured to construct a sub-quantum Karnaugh map corresponding to each sub-circuit based on the input/output relation of each sub-circuit, and a third logic unit configured to obtain a product of entries in the same position of each sub-quantum Karnaugh map to determine a quantum Karnaugh map corresponding to the quantum circuit.
  • Each of the multiple number of sub-circuits can include single qubit gates and C-NOT gates.
  • a computing device configured to design a quantum circuit.
  • the computing device includes a first module configured to group entries other than identity (I) entries in a quantum Karnaugh map into one or more rectangular groups, and to determine a multiple number of sets of rectangular groups, a second module configured to determine a plurality of quantum circuits corresponding to the quantum Karnaugh map based on the multiple number of sets of rectangular groups, a third module configured to determine the number of single qubit gates and C-NOT gates required for each of the multiple number of quantum circuits, and a selector configured to select a quantum circuit having aminimum number of single qubit gates and C-NOT gates among the multiple number of quantum circuits.
  • Each of the rectangular groups is comprised of neighboring entries, and the number of the neighboring entries of each rectangular group is 2 n (n is an integer equal to or greater than zero).
  • the first module can be further configured to determine the multiple number of sets of rectangular groups for each sequence of control qubits of the quantum Karnaugh map.
  • the minimum number of single qubit gates and C-NOT gates can be determined based on the following equation:
  • m is the number of control qubits
  • Q(m/2) is a quotient of m/2
  • R(m/2) is a remainder of m/2
  • N m is the minimum number of single qubit gates and C-NOT gates.
  • the computing device may be implemented as a portion of a small-form factor portable electronic device or a personal computer.
  • a method for designing a quantum circuit implemented on a computing device includes receiving entries other than identity (I) entries in a quantum Karnaugh map to group into one or more rectangular groups, and determining a multiple number of sets of rectangular groups, determining a plurality of quantum circuits corresponding to the quantum Karnaugh map based on the plurality of sets of rectangular groups, determining the number of single qubit gates and C-NOT gates required for each of the plurality of quantum circuits, and selecting a quantum circuit having the minimum number of single qubit gates and C-NOT gates among the plurality of quantum circuits.
  • Each rectangular group is comprised of neighboring entries, and the number of the neighboring entries of each rectangular group is 2 n (n is an integer equal to or greater than zero).
  • the multiple number of sets of rectangular groups can be determined for each sequence of control qubits of the quantum Karnaugh map.
  • m is the number of control qubits
  • Q(m/2) is a quotient of m/2
  • R(m/2) is a remainder of m/2
  • N m is the minimum number of gates.
  • a storage medium device having computer readable instructions embodied therewith.
  • the computer readable instructions when executed on a computing device cause the computing device to perform the aforementioned method.
  • FIG. 1 shows a schematic of selected components of an illustrative embodiment of a computing device 100 configured to determine a quantum Karnaugh map corresponding to a quantum circuit.
  • computing device 100 includes a decomposer 110, a first logic unit 120, a second logic unit 130, and a third logic unit 140.
  • decomposer 110 receives as input a quantum circuit 150.
  • Quantum circuit 150 can refer to a representation of a quantum state evolution of a circuit in Hilbert space.
  • quantum circuit 150 may be represented by a vector in a Hilbert space state, which is a linear superposition of all binary states of quantum bits. Quantum circuit 150 is further described below in conjunction with Fig. 2.
  • Decomposer 110 decomposes the received quantum circuit 150 into a multiple numberof sub-circuits 150-1 to 150-n.
  • quantum circuit 150 can be decomposed such that each of sub-circuits 150-1 to 150-n includes at least one unitary logic operator (U).
  • U unitary logic operator
  • the possible input values of each of sub-circuits 150-1 to 150-n are input into first logic unit 120.
  • First logic unit 120 determines corresponding output values of each of sub-circuits 150-1 to 150-n in response to the possible input values of each of sub-circuits 150-1 to 150-n to obtain an input/output relation of each of sub-circuits 150-1 to 150-n.
  • the term "input/output relation" means a corresponding relation of the possible input values of each of sub-circuits 150-1 to 150-n and the output values of each of sub-circuits 150-1 to 150-n.
  • the input/output relation may be represented by a matching table (for example, Tables 1 and 2 below).
  • first logic unit 120 can obtain an input/output relation of first sub-circuit 150-1 by determining the output values corresponding to the possible input values of first sub-circuit 150-1 based on the logic structure of first sub-circuit 150-1. By repeating the above operation of first logic unit 120 on the remaining sub-circuits 150-2 to 150-n, the input/output relations of sub-circuits 150-1 to 150-n can be determined.
  • Second logic unit 130 receives as input the input/output relation of each sub-circuit and constructs a sub-quantum Karnaugh map corresponding to each of sub-circuits 150-1 to 150-n based on the input/output relation of each sub-circuit.
  • a sub-circuit having two (2) control qubits i.e., a first control qubit and a second control qubit
  • a sub-quantum Karnaugh map corresponding to the sub-circuit can be obtained as follows.
  • Third logic unit 140 receives as input the multiple number (n) of sub-quantum Karnaugh maps constructed by second logic unit 130 and performs a product of entries in the same position of the multiple number (n) of sub-quantum Karnaugh maps to generate a quantum Karnaugh map 160 corresponding to quantum circuit 150. Specifically, third logic unit 140 performs a product of entries in the first row and first column of each of the sub-quantum Karnaugh maps to obtain an entry for the first row and first column of quantum Karnaugh map 160. Similarly,third logic unit 140 performs a product of entries in i th row and j th column of each of sub-quantum Karnaugh maps to obtain an entry for i th row and j th column of quantum Karnaugh map 160.
  • FIG. 2 shows a schematic of an illustrative embodiment of the processing of one example quantum circuit 210 by computing device 100 shown in FIG. 1.
  • quantum circuit 210 is a three-qubit quantum circuit having two control qubits "
  • Quantum circuit 210 includes two unitary operators ("U”), and two exclusive-OR operators (" ").
  • a first unitary operator on a left 210-1 of quantum circuit 210 is turned on when
  • a second unitary operator on a right 210-2 of quantum circuit 210 is turned on when
  • I identity operator
  • Tout> represents I when
  • Tin> can be an arbitrary input value of a target qubit.
  • three-qubit quantum circuit 210 can be decomposed into two sub-quantum circuits G(U) and H(U) by decomposer 110 (shown in FIG. 1).
  • H(U) is a first sub-quantum circuit that includes the first unitary operator (U)
  • G(U) is a second sub-quantum circuit that includes the second unitary operator (U) and two exclusive-OR operators ( ).
  • FIG. 2 illustrates three-qubit quantum circuit 210 having the first and second sub-quantum circuits H(U) and G(U)
  • the configuration of quantum circuits is not limited to three-qubit quantum circuit 210.
  • the decomposition of 3-qubit quantum circuit 210 is not limited to the illustrated example.
  • 3-qubit quantum circuit 210 can be decomposed into first and second sub-quantum circuits each having one unitary operator (U), and one exclusive-OR operator ( ).
  • First logic unit 120 processes possible inputs of G(U) and H(U) and determines outputs of the two sub-quantum circuits G(U) and H(U) to obtain an input/output relation of each of the sub-quantum circuits G(U) and H(U).
  • the first sub-quantum circuit H(U) executes a unitary operator U when
  • the secondsub-quantum circuit G(U) executes a unitary operator U when one of the two inputs is
  • the first and second sub-quantum circuits H(U) and G(U) have the following input/output relations.
  • Second logic unit 130 constructs sub-quantum Karnaugh maps 220 and 230 for the sub-quantum circuits G(U) and H(U) based on the input/output relations of G(U) and H(U) as shown in Tables 1 and 2 above.
  • Third logic unit 140 performs an operation (GoH)(U) between sub-quantum Karnaugh maps 220 and 230 to produce a quantum Karnaugh map 240.
  • the "o" operation is defined such that an entry in the ith row and jthcolumn of quantum Karnaugh map 240 of (GoH)(U) is obtained from a product of entries [G] ij and [H] ij of the i th row and j th column of sub-quantum Karnaugh maps 230 and 220, respectively.
  • quantum Karnaugh map 240 can be generated from the operation (GoH)(U) between sub-quantum Karnaugh maps 220 and 230.
  • an entry in the first row and first column of quantum Karnaugh map 240 is obtained from a product of an entry "I” in the first row and first column of sub-quantum Karnaugh map 220 and an entry "I” in the first row and firstcolumn of sub-quantum Karnaugh map 230.
  • Entries in the first row and second column, second row and first column, and second row and second column of quantum Karnaugh map 240 can be obtained in a similar manner as illustrated above.
  • quantum Karnaugh map 240 of quantum circuit 210 can be readily determined using the "o" operation and simplified sub-quantum Karnaugh maps. Therefore, even if a quantum circuit is configured with a large number of complex circuit elements, a Karnaugh map corresponding to the quantum circuit can be efficiently obtained by decomposing the quantum circuit into simpler sub-circuits, obtaining Karnaugh maps of the sub-circuits, and performing the "o" operation on the obtained Karnaugh maps of the sub-circuits.
  • FIG. 3 is a schematic of selected components of an illustrative embodiment of a computing device configured to design a quantum circuit based on a quantum Karnaugh map.
  • a computing device 300 includes a first module 310, a second module 320, a third module 330, and a selector 340.
  • First module 310 receives a quantum Karnaugh map 350,and groups entries other than identity (I) entriesin quantum Karnaugh map 350 into one or more rectangular groups such that each rectangular group is comprised of neighboring entries, and the number of the neighboring entries of each rectangular group is 2 n (n is an integer equal to or greater than zero).
  • Various sets of rectangular groups for quantum Karnaugh map 350 can be determined.
  • each sequence of control qubits of quantum Karnaugh map 350 can be used in determining the sets of rectangular groups.
  • Gray Code sequence is an ordering of 2 n binary numbers such that only one bit changes from one entry to the next.
  • Gray Code sequence of control qubits C 1 and C 2 can be
  • Second module 320 receives the determined multiple number of sets of rectangular groups from first module 310 and determines a multiple number of quantum circuits corresponding to quantum Karnaugh map 350 based on the sets of rectangular groups.
  • the quantum circuits can be determined by obtaining qubit gates corresponding to rectangular groups where each qubit gate is controlled by qubits which each rectangular group depends on, and decomposing each qubit gate into C-NOT gates, and single qubit gates. Details for C-NOT gate, and single qubit gate will be explained later.
  • Third module 330 receives the multiple number of quantum circuits determined by second module 320 and determines the number of C-NOT gates and single qubit gates requiredfor each quantum circuit determined based on the multiple number of sets of rectangular groups.
  • Selector 340 receives the multiple number of quantum circuits from second module 320 and the number of C-NOT gates and single qubit gates required for each quantum circuit from third module 330, and chooses a quantum circuit 360 which requires the minimum number of C-NOT gates and single qubit gates based on the numbers of C-NOT gates and single qubit gates for each quantum circuit determined in third module 330. Then, selector 340outputs the chosen quantum circuit (for example, quantum circuit 360).
  • FIG. 4 shows schematics of examples of the quantum Karnaugh map of FIG. 3.
  • One example is a quantum Karnaugh map 410 that corresponds to a quantum circuit controlled by two control qubits C1, and .
  • Quantum Karnaugh map 410 includes two rectangular groups 411 and 412 where each rectangular group includes "X" entries other than identity (I) entries.
  • Quantum Karnaugh map 410 shows that rectangulargroup 411 depends on control qubit C1 regardless of control qubit , and rectangular group 412 depends on control qubit regardless of control qubit C1.
  • quantum gates corresponding to rectangular groups 411 and 412 are one-qubit gates which are controlled by control qubits C1 and , respectively.
  • Quantum Karnaugh map 420 that corresponds to a quantum circuit controlled by three control qubits C1, C2, and .
  • Quantum Karnaugh map 420 includes two rectangular groups 421 and 422 where each rectangular group includes "X" entries other than identity (I) entries.
  • Quantum Karnaugh map 420 shows that rectangular group 421 depends on control qubits C1 and C2 regardless of control qubit , and rectangular group 422 depends on control qubits C2 and regardless of control qubit C1.
  • quantum gates corresponding to rectangular groups 421 and 422 are two-qubit gates which are controlled by control qubits C1 and C2, and control qubits C2 and , respectively.
  • a further example is a quantum Karnaugh map 430 that corresponds to a quantum circuit controlled by three control qubits C1, C2, and .
  • Quantum Karnaugh map 430 includes two rectangular groups 431 and 432 where each rectangular group includes "X" entries other than identity (I) entries.
  • Quantum Karnaugh map 430 shows that rectangular group 431 depends on control qubits C1 and C2, and rectangular group 432 depends on control qubit .
  • a quantum gate corresponding to rectangular groups 431 is two-qubit gate which is controlled by control qubits C1 and C2 regardless of control qubit
  • a quantum gate corresponding to rectangular groups 432 is one-qubit gate which is controlled by control qubit regardless of control qubit C1and C2.
  • C m (X) having m control qubits for each rectangular group can be obtained.
  • m is an integer equal to or greater than zero.
  • FIGS. 5(a) and 5(b) show schematics of a C 2 (X) gate, and its decomposed structure.
  • FIG. 5(a) represents a decomposed structure of one exampleof two-qubit C 2 (X) gate.
  • C 2 (X) gate 510 in FIG. 5(a) can be simulated to an arbitrary degree of accuracy using single qubit gates H, S, T, composed structure of C 2 (X) gate 510 in FIG. 5(a) can be expressed using the "?” operation, and thus quantum circuit where
  • C-NOT gate represents exclusive-OR operation " ".
  • a first block 520 of the decomposed structure of C 2 (X) gate 510 in FIG. 5(a) includes two H gates, two T gates, two gates, two C-NOT gates controlled by C 1 , and two C-NOT gates controlled by C 2 .
  • a second block 530 of the decomposed structure of C2(X) gate 510 in FIG. 5(a) includes one T gate, two gates, one S gate, and two C-NOT gates controlled by C 1 .
  • second block 530 can be expressed using C 1 (S) I gate 530-1, which is equivalent to "iI" gate 530-2 controlled by C 1 and C 2 , as shown in FIG. 5(b).
  • the decomposed structure of C 2 (X) gate 510 in FIG. 5(a) can be expressed using the "?” operation, and thus quantum Karnaugh maps corresponding to the single qubit gates and C-NOT gates as follows.
  • Equation (1) , , , and represent corresponding quantum Karnaugh maps of single qubit gates , , and , respectively. Further, represents a corresponding quantum Karnaugh map of C-NOT gate, and the subscripts "C1" and "C2" denote the case where entries in a quantum Karnaugh map of each single qubit gate are unitary operators when control quits
  • Equation (1) m-qubit C m (X) gate can be expressed using the "?” operation, and thus quantum Karnaugh maps corresponding to the single qubit gates and C-NOT gates as follows.
  • Equation (2) can be derivedby replacing of C 2 (X) in Equation (1) with , and respectively.
  • j m - i (each of j, m, and j is equal to or greater than zero), and can be replaced by C i (X) and C j (X), respectively.
  • C m (X) can also be expressed as follows.
  • C m (X) can be decomposed into single qubit gates and C-NOT gates.
  • Equations (1), (2), and (3) for each set of rectangular groups of quantum Karnaugh map 350 a multiple number of quantum circuits corresponding to quantum Karnaugh map 350 can be determined.
  • the number of gates that each of the quantum circuits includes can be counted at third module 330.
  • Acomputer simulation shows that the minimum number N m of single qubit gates and C-NOT gates required to construct gate can be represented by Equation (4) below.
  • Equation (4) Q(m/2) is a quotient of m/2 and R(m/2) is a remainder of m/2.
  • the number of single qubit gates and C-NOT gates required to construct C 2 (X) shown in FIG. 5(a) can be determined to be sixteen (16) based on Equation (4).
  • FIG. 6 shows a graph showing the minimum number of single qubit gates and C-NOT gates required to construct a quantum circuit for C m (X) gate using computing device 300 in FIG. 3.
  • a bar graph (a) represents the minimum number of gates required to construct a quantum circuit using computing device 300 in FIG. 3 which is based on eachqubit sequence
  • a bar graph (b) represents the number of gates required to construct a quantum circuit based on Gray Code sequence.
  • FIG. 6 shows that the number of gates of a quantum circuit designed using computing device 300 in FIG. 3 becomessignificantly less than that of a quantum circuit designed using a quantum Karnaugh map based on Gray Code sequence, as the qubit number m increases.
  • a quantum circuit can be designed with the minimum number of single qubit gates and C-NOT gates.
  • a quantum circuit having the minimum number of gates can be determined through grouping entries of the quantum Karnaugh map, determining quantum circuits based on the grouping result, and selecting a quantum circuit with the minimum number of single qubit gates and C-NOT gates.
  • FIG. 7 is a block diagram illustrating an example computing device 700 that is configured for processing a quantum Karnaugh map in accordance with the present disclosure.
  • computing device 700 typically includes one or more processors 704 and a system memory 706.
  • a memory bus 708 may be used for communicating between processor 704 and system memory 706.
  • processor 704 may be of any type including but not limited to a microprocessor ( ⁇ P), a microcontroller ( ⁇ C), a digital signal processor (DSP), or any combination thereof.
  • Processor 704 may include one more levels of caching,such as a level one cache 710 and a level two cache 712, a processor core 714, and registers 716.
  • An example processor core 714 may include an arithmetic logic unit (ALU), a floating point unit (FPU), a digital signal processing core (DSP Core), or any combination thereof.
  • An example memory controller 718 may also be used with processor 704, or in some implementations memory controller 718 may be an internal part of processor 704.
  • system memory 706 may be of any type including but not limited to volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.) or any combination thereof.
  • System memory 706 may include an operating system 720, one or more applications 722, and program data 724.
  • Application 722 may include a quantum Karnaugh map processing process 726 (e.g., the quantum Karnaugh map generation process described above in conjunction with decomposer 110, first logic unit 120, second logic unit 130, and third logic unit 140 of FIG. 1 and/or the quantum circuit design process described above in conjunction with first module 310, second module 320, third module 330, and selector 340 of FIG.
  • quantum Karnaugh map processing process 726 e.g., the quantum Karnaugh map generation process described above in conjunction with decomposer 110, first logic unit 120, second logic unit 130, and third logic unit 140 of FIG. 1 and/or the quantum circuit design process described above in conjunction with first module 310, second module 320, third module 330, and selector
  • Program data 724 may include quantum data 728 that may be useful for determining a quantum Karnaugh map and/or generating a quantum circuit from a quantum Karnaugh map, as is described herein.
  • application 722 may be arranged to operate with program data 724 on operating system 720 such that a Karnaugh map corresponding to the quantum circuit can be efficiently obtained and/or a quantum circuit can be efficiently designed.
  • This described basic configuration 702 is illustrated in FIG. 7 by those components within the inner dashed line.
  • Computing device 700 may have additional features or functionality, and additional interfaces to facilitate communications between basic configuration 702 and any required devices and interfaces.
  • a bus/interface controller 730 may be used to facilitate communications between basic configuration 702 and one or more data storage devices 732 via a storage interface bus 734.
  • Data storage devices 732 may be removable storage devices 736, non-removable storage devices 738, or a combination thereof. Examples of removable storage and non-removable storage devices include magnetic disk devices such as flexible disk drives and hard-disk drives (HDD), optical disk drives such as compact disk (CD) drives or digital versatile disk (DVD) drives, solid state drives (SSD), and tape drives to name a few.
  • Example computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which may be used to store the desired information and which may be accessed by computing device 700. Any such computer storage media may be part of computing device 700.
  • Computing device 700 may also include an interface bus 740 for facilitating communication from various interface devices (e.g., output devices 742, peripheral interfaces 744, and communication devices 746) to basic configuration 702 via bus/interface controller 730.
  • Example output devices 742 include a graphics processing unit 748 and an audio processing unit 750, which may be configured to communicate to various external devices such as a display or speakers via one or more A/V ports 752.
  • Example peripheral interfaces 744 include a serial interface controller 754 or a parallel interface controller 756, which may be configured to communicate with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device, etc.) or other peripheral devices (e.g., printer, scanner, etc.) via one or more I/O ports 758.
  • An example communication device 746 includes a network controller 760, which may be arranged to facilitate communications with one or more other computing devices 762 over a network communication link via one or more communication ports 764.
  • the network communication link may be one example of a communication media.
  • Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media.
  • a "modulated data signal" may be a signal that has one or more of its characteristics set or changed in such a manner as to encode information in thesignal.
  • communication media may include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), microwave, infrared (IR) and other wireless media.
  • RF radio frequency
  • IR infrared
  • the term computer readable media as used herein may include both storage media and communication media.
  • Computing device 700 may be implemented as a portion of a small-form factor portable (or mobile) electronic device such as a cell phone, a personal dataassistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions.
  • a small-form factor portable (or mobile) electronic device such as a cell phone, a personal dataassistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions.
  • PDA personal dataassistant
  • Computing device 700 may also be implemented as a personal computer including both laptop computer and non-laptop computer configurations.
  • a storage medium device having computer readable instructions embodied therewith is provided.
  • the computer readable instructions when executed on computing device 700, cause computing device 700 to perform the method to determine a quantum Karnaugh map and/or to generate a quantum circuit from a quantum Karnaugh map, as is described herein.
  • a range includes each individual member.
  • a group having 1-3 cells refers to groups having 1, 2, or 3 cells.
  • a group having 1-5 cells refers to groups having 1, 2, 3, 4, or 5 cells, and so forth.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Nanotechnology (AREA)
  • Chemical & Material Sciences (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • Evolutionary Computation (AREA)
  • Crystallography & Structural Chemistry (AREA)
  • Data Mining & Analysis (AREA)
  • Computing Systems (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Software Systems (AREA)
  • Mathematical Analysis (AREA)
  • Computer Hardware Design (AREA)
  • Condensed Matter Physics & Semiconductors (AREA)
  • Computational Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Geometry (AREA)
  • Optical Modulation, Optical Deflection, Nonlinear Optics, Optical Demodulation, Optical Logic Elements (AREA)
  • Logic Circuits (AREA)

Abstract

L'invention concerne des techniques et un dispositif informatique permettant de déterminer une table de Karnaugh quantique par la décomposition d'un circuit quantique en de multiples sous-circuits. Elle concerne aussi des techniques et un dispositif informatique permettant d'obtenir un circuit quantique qui comprend le nombre minimum de portes parmi les circuits quantiques possibles correspondant à une table de Karnaugh quantique.
PCT/KR2010/008656 2009-12-08 2010-12-06 Table de karnaugh quantique WO2011071282A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2012543022A JP5537669B2 (ja) 2009-12-08 2010-12-06 量子カルノー図

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/633,575 US8671369B2 (en) 2009-12-08 2009-12-08 Quantum Karnaugh map
US12/633,575 2009-12-08

Publications (1)

Publication Number Publication Date
WO2011071282A1 true WO2011071282A1 (fr) 2011-06-16

Family

ID=44083269

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2010/008656 WO2011071282A1 (fr) 2009-12-08 2010-12-06 Table de karnaugh quantique

Country Status (3)

Country Link
US (2) US8671369B2 (fr)
JP (1) JP5537669B2 (fr)
WO (1) WO2011071282A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11250190B2 (en) 2017-09-22 2022-02-15 International Business Machines Corporation Simulating quantum circuits

Families Citing this family (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070288684A1 (en) * 2006-04-25 2007-12-13 Magiq Technologies, Inc. Quantum circuit for quantum state discrimination
US8671369B2 (en) 2009-12-08 2014-03-11 University Of Seoul Industry Cooperation Foundation Quantum Karnaugh map
US9836698B2 (en) * 2012-07-19 2017-12-05 Microsoft Technology Licensing, Llc Method and system for decomposing single-qubit quantum circuits into a discrete basis
US9064067B2 (en) * 2012-08-06 2015-06-23 Microsoft Technology Licensing, Llc Quantum gate optimizations
US9412074B2 (en) * 2013-06-28 2016-08-09 Microsoft Technology Licensing, Llc Optimized trotterization via multi-resolution analysis
CN107004161B (zh) 2014-11-21 2020-06-02 微软技术许可有限责任公司 针对clifford+t基上的对角算子的高效实现的方法
US11113084B2 (en) 2015-04-10 2021-09-07 Microsoft Technology Licensing, Llc Method and system for approximate quantum circuit synthesis using quaternion algebra
US10740689B2 (en) 2015-04-10 2020-08-11 Microsoft Technology Licensing, Llc Method and system for quantum circuit synthesis using quaternion algebra
US10140404B2 (en) 2015-11-06 2018-11-27 Rigetti & Co, Inc. Analyzing quantum information processing circuits
US20180046933A1 (en) * 2016-08-11 2018-02-15 Board Of Regents, The University Of Texas System System and method for controlling a quantum computing emulation device
US10922457B2 (en) * 2017-10-19 2021-02-16 University Of Maryland Automated optimization of large-scale quantum circuits with continuous parameters
US10599805B2 (en) * 2017-12-01 2020-03-24 International Business Machines Corporation Superconducting quantum circuits layout design verification
US10592814B2 (en) * 2017-12-01 2020-03-17 International Business Machines Corporation Automatic design flow from schematic to layout for superconducting multi-qubit systems
WO2019144118A1 (fr) 2018-01-22 2019-07-25 D-Wave Systems Inc. Systèmes et procédés pour améliorer les performances d'un processeur analogique
CN108416445B (zh) * 2018-03-13 2022-04-29 杭州思源信息技术股份有限公司 一种量子实信号的存储与量子线路实现的设计方法
WO2020112185A2 (fr) 2018-08-31 2020-06-04 D-Wave Systems Inc. Systèmes et procédés pour le fonctionnement d'une entrée et/ou d'une sortie de résonateur multiplexé en fréquence pour un dispositif supraconducteur
US11609751B2 (en) 2018-12-19 2023-03-21 International Business Machines Corporation Adaptive quantum circuit construction for multiple-controlled-NOT gates
US11176478B2 (en) 2019-02-21 2021-11-16 International Business Machines Corporation Method for estimating a quantum phase
US11288073B2 (en) 2019-05-03 2022-03-29 D-Wave Systems Inc. Systems and methods for calibrating devices using directed acyclic graphs
JP2022540311A (ja) * 2019-07-12 2022-09-15 ディー－ウェイブ システムズ インコーポレイテッド 量子プロセッサをシミュレートするシステム及び方法
US11586982B2 (en) * 2019-09-18 2023-02-21 Samsung Electronics Co., Ltd. Electronic and atomic structure computation utilizing machine learning
US11537898B2 (en) 2019-10-02 2022-12-27 Samsung Electronics Co., Ltd. Generative structure-property inverse computational co-design of materials
CN112632881B (zh) * 2020-01-17 2022-03-08 腾讯科技（深圳）有限公司 量子克里福德电路的容错计算方法、装置、设备及芯片
CN113222155B (zh) * 2020-01-21 2023-08-11 本源量子计算科技（合肥）股份有限公司 一种量子线路的构建方法、装置、电子装置和存储介质
US20210256416A1 (en) * 2020-02-13 2021-08-19 Microsoft Technology Licensing, Llc Training of variational quantum classifiers by parametric coordinate ascent
WO2023175228A1 (fr) * 2022-03-14 2023-09-21 Iqm Finland Oy Procédé de détermination d'une séquence de commandes pour des interactions de bits quantiques et circuit quantique, dispositif quantique et procédé de résolution d'un problème

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060123363A1 (en) * 2004-12-07 2006-06-08 Williams Colin P Method and apparatus for automated design of quantum circuits

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN2232035Y (zh) 1995-08-18 1996-07-31 同济大学 固定膜光催化氧化水质深度净化器
CN2280090Y (zh) 1996-12-21 1998-04-29 中国科学院广州能源研究所 光催化水质处理器
US6133754A (en) * 1998-05-29 2000-10-17 Edo, Llc Multiple-valued logic circuit architecture; supplementary symmetrical logic circuit structure (SUS-LOC)
US6215327B1 (en) * 1999-09-01 2001-04-10 The United States Of America As Represented By The Secretary Of The Air Force Molecular field programmable gate array
JP2002042104A (ja) 2000-07-27 2002-02-08 Yamaha Motor Co Ltd 量子ソフトコンピューティングを使用した制御システムと制御方法
US6779158B2 (en) * 2001-06-15 2004-08-17 Science & Technology Corporation @ Unm Digital logic optimization using selection operators
US6978426B2 (en) * 2002-04-10 2005-12-20 Broadcom Corporation Low-error fixed-width modified booth multiplier
US7180645B2 (en) * 2003-04-01 2007-02-20 Canon Kabushiki Kaisha Quantum-state-generating apparatus, Bell measurement apparatus, quantum gate apparatus, and method for evaluating fidelity of quantum gate
US7823112B1 (en) * 2003-05-30 2010-10-26 Golden Gate Technology, Inc. Method, software and system for ensuring timing between clocked components in a circuit
JP4047795B2 (ja) * 2003-10-31 2008-02-13 株式会社東芝 量子計算方法および量子計算機
US7920704B2 (en) * 2004-10-09 2011-04-05 The United States Of America As Represented By The Secretary Of The Army Systems and methods for obtaining information on a key in BB84 protocol of quantum key distribution
EP1672569A1 (fr) * 2004-12-20 2006-06-21 STMicroelectronics S.r.l. Procédé d'exécution d'un algorithme quantique pour simuler un algorithme génétique
US7619437B2 (en) * 2004-12-30 2009-11-17 D-Wave Systems, Inc. Coupling methods and architectures for information processing
JP4260751B2 (ja) 2005-01-11 2009-04-30 日本電信電話株式会社 ユニタリ行列分解装置、ユニタリ行列分解方法、ユニタリ行列分解プログラム及び記録媒体
US7873130B2 (en) * 2005-08-10 2011-01-18 Ludwig Lester F Frequency comparator utilizing enveloping-event detection via symbolic dynamics of fixed or modulated waveforms
TW200811684A (en) * 2006-02-17 2008-03-01 Mentor Graphics Corp Gate modeling for semiconductor fabrication process effects
US7398507B2 (en) * 2006-05-10 2008-07-08 Tatung Company Method of automatic synthesis of sequential quantum Boolean circuits
JP4904107B2 (ja) 2006-07-25 2012-03-28 日本電信電話株式会社 制御回転ゲート、その決定装置、その決定方法、そのプログラム及びその記録媒体
US8671369B2 (en) 2009-12-08 2014-03-11 University Of Seoul Industry Cooperation Foundation Quantum Karnaugh map
US8631367B2 (en) * 2010-12-16 2014-01-14 Northrop Grumman Systems Corporation Methods of increasing fidelity of quantum operations

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060123363A1 (en) * 2004-12-07 2006-06-08 Williams Colin P Method and apparatus for automated design of quantum circuits

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
SAEEDI M. ET AL: "Algebraic, Characterization of CNOT-Based Quantum Circuits with its Applications on Logic Synthesis", 10TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN ARCHITECTURES, METHODS AND TOOLS (DSD 2007), 29 August 2007 (2007-08-29), LUBECK, GERMANY, pages 339 - 346, XP031141383 *
WANG S. ET AL: "Modified Karnaugh Map for Quantum Boolean Circuits Construction", THIRD IEEE CONFERENCE ON NANOTECHNOLOGY (IEEE-NANO 2003), vol. 2, August 2003 (2003-08-01), pages 651 - 654, XP010656969 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11250190B2 (en) 2017-09-22 2022-02-15 International Business Machines Corporation Simulating quantum circuits

Also Published As

Publication number Publication date
US8671369B2 (en) 2014-03-11
JP2013513181A (ja) 2013-04-18
JP5537669B2 (ja) 2014-07-02
US20110138344A1 (en) 2011-06-09
US9147019B2 (en) 2015-09-29
US20140157214A1 (en) 2014-06-05

Similar Documents

Publication Publication Date Title
WO2011071282A1 (fr) Table de karnaugh quantique
US7640284B1 (en) Bit reversal methods for a parallel processor
EP0523544A2 (fr) Dispositif de calcul pour résoudre des systèmes d'équations linéaires
CN111461311B (zh) 基于众核处理器的卷积神经网络运算加速方法及装置
Fan et al. Efficient unicast in bijective connection networks with the restricted faulty node set
JP4698394B2 (ja) 高速フーリエ変換回路
Ploskas et al. GPU accelerated pivoting rules for the simplex algorithm
CN111737638A (zh) 基于傅里叶变换的数据处理方法及相关装置
WO2021036729A1 (fr) Procédé de calcul matriciel, dispositif de calcul, et processeur
WO2015056818A1 (fr) Filtre de bloom de comptage
Daily et al. A work stealing based approach for enabling scalable optimal sequence homology detection
JP2015503785A (ja) Ｆｆｔ／ｄｆｔの逆順ソーティングシステム、方法およびその演算システム
CN111079908A (zh) 片上网络数据处理方法、存储介质、计算机设备和装置
JPWO2008129900A1 (ja) アレイプロセッサ型データ処理装置
WO2023068463A1 (fr) Système de dispositif de stockage pour simulation de circuit quantique
Wirawan et al. Parallel DNA sequence alignment on the cell broadband engine
Daley et al. Template-guided DNA recombination
WO2020027386A1 (fr) Procédé de traitement d'optimisation de calcul de matrice de chiffrement de masse dans un environnement de dispositif de puissance
WO2020184816A1 (fr) Procédé de traitement de données pour obtenir un nouveau médicament candidat
Kageyama et al. Implementation of Floating‐Point Arithmetic Processing on Content Addressable Memory‐Based Massive‐Parallel SIMD matriX Core
Chen et al. AMT: asynchronous in-place matrix transpose mechanism for sunway many-core processor
WO2023214609A1 (fr) Procédé de calcul de circuit quantique pour calculer efficacement des vecteurs d'état
WO2023090499A1 (fr) Procédé d'élagage de filtre basé sur l'apprentissage de la rareté pour réseaux neuronaux profonds
WO2023075146A1 (fr) Système informatique et son procédé de transposition
Kruskal et al. Observations concerning multidimensional ultracomputers

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10836178

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2012543022

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10836178

Country of ref document: EP

Kind code of ref document: A1