# US 2014/0157214 A1 · Quantum karnaugh map > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2014/0157214 A1 - Document ID: US20140157214A1 - Status: Published application - Kind: A1 - Application number: 14/173,422 - Filed: 2014-02-05 - Published: 2014-06-05 - Earliest claimed: 2009-12-08 - Assignees: University of Seoul Industry Cooperation Foundation - Applicants: University of Seoul Industry Cooperation Foundation - Inventors: Doyeol AHN - Web page: https://patentgrep.com/patent/US20140157214A1 ## CPC - G06F 30/33: Design verification, e.g. functional simulation or model checking - B82Y 10/00: Nanotechnology for information processing, storage or transmission, e.g. quantum computing or single electron logic - G06N 10/20: Models of quantum computing, e.g. quantum circuits or universal quantum computers - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - B82Y: SPECIFIC USES OR APPLICATIONS OF NANOSTRUCTURES; MEASUREMENT OR ANALYSIS OF NANOSTRUCTURES; MANUFACTURE OR TREATMENT OF NANOSTRUCTURES - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS ## Abstract Techniques for determining and a computing device configured to determine a quantum Karnaugh map through decomposing a quantum circuit into a multiple number of sub-circuits are provided. Also, techniques for obtaining and a computing device configured to obtain a quantum circuit which includes the minimum number of gates among possible quantum circuits corresponding to a quantum Karnaugh map are also provided. ## Claims ### Claim 1 A computing device configured to determine a quantum Karnaugh map corresponding to a quantum circuit, the computing device comprising: a decomposer configured to decompose a quantum circuit into a plurality 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. ### Claim 2 (depends on 1) The computing device of claim 1, wherein each of the plurality of sub-circuits comprises single qubit gates and C-NOT gates. ### Claim 3 (depends on 1) The computing device of claim 1, wherein the third logic unit is configured to receive as input multiple number of sub-quantum Karnaugh maps constructed by the second logic unit. ### Claim 4 (depends on 1) The computing device of claim 1, wherein the third logic unit is configured to perform a product of entries in the same position of the multiple number of sub-quantum Karnaugh maps to generate the quantum Karnaugh map corresponding to the quantum circuit. ### Claim 5 (depends on 1) The computing device of claim 1, wherein the quantum circuit is a three-qubit quantum circuit having two control qubits and one target qubit. ### Claim 6 (depends on 5) The computing device of claim 5, wherein the quantum circuit includes two unitary operators, and two exclusive-OR operators. ### Claim 7 (depends on 6) The computing device of claim 6, wherein the two unitary operators include first and second unitary operators, and when the first unitary operator and the second unitary operator are turned off, the first and second unitary operators operate as an identity operator. ### Claim 8 (depends on 1) The computing device of claim 1, wherein the decomposer receives as input the quantum circuit during operation. ### Claim 9 (depends on 8) The computing device of claim 8 wherein the quantum circuit includes a representation of a quantum state evolution of a circuit in Hilbert space. ### Claim 10 (depends on 1) The computing device of claim 1, wherein the computing device is implemented as a portion of a small-form factor portable electronic device. ### Claim 11 (depends on 1) The computing device of claim 1, wherein the computing device is implemented as a personal computer. ### Claim 12 A computing device configured to determine a quantum Karnaugh map corresponding to a quantum circuit, the computing device comprising: a decomposer configured to receive the quantum circuit and decompose a quantum circuit into a plurality 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 receive as input multiple numbers of sub-quantum Karnaugh maps constructed by the second logic unit, the third logic unit further configured to obtain a product of entries in the same position of each sub-quantum Karnaugh map to determine the quantum Karnaugh map corresponding to the quantum circuit. ### Claim 13 (depends on 12) The computing device of claim 12, wherein each of the plurality of sub-circuits comprises single qubit gates and C-NOT gates. ### Claim 14 (depends on 12) The computing device of claim 12, wherein the third logic unit is configured to perform a product of entries in the same position of the multiple number of sub-quantum Karnaugh maps to generate the quantum Karnaugh map corresponding to the quantum circuit. ### Claim 15 (depends on 12) The computing device of claim 12, wherein the quantum circuit is a three-qubit quantum circuit having two control qubits and one target qubit. ### Claim 16 (depends on 15) The computing device of claim 15, wherein the quantum circuit includes two unitary operators, and two exclusive-OR operators. ### Claim 17 (depends on 16) The computing device of claim 16, wherein the two unitary opperators include first and second unitary operators, and when the first unitary operator and the second unitary operator are turned off, the first and second unitary operators operate as an identity operator. ### Claim 18 (depends on 12) The computing device of claim 12 wherein the quantum circuit includes a representation of a quantum state evolution of the quantum circuit in Hilbert space. ### Claim 19 A computing device configured to determine a quantum Karnaugh map corresponding to a quantum circuit, the computing device comprising: a decomposer configured to receive the quantum circuit as input and decompose a quantum circuit into a plurality of sub-circuits each of which includes single qubit gates and C-NOT gates; 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 receive as input multiple number of sub-quantum Karnaugh maps constructed by the second logic unit, the third logic unit further 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. ### Claim 20 (depends on 19) The computing device of claim 19, wherein the third logic unit is configured to perform a product of entries in the same position of the multiple number of sub-quantum Karnaugh maps to generate the quantum Karnaugh map corresponding to the quantum circuit.