PATENT CLAIM ANALYSIS

Application Number: 16014117
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-10
Patent Classification: ["714", "724000"]

Abstract:
A method and associated systems for using direct sums and invariance groups to optimize the testing of partially symmetric quantum-logic circuits is disclosed. A test system receives information that describes the architecture of a quantum-logic circuit to be tested. The system uses this information to organize the circuit's inputs into two or more mutually exclusive subsets of inputs. The system computes a direct sum of a set of groups associated with the subsets in order to generate an invariance group that contains one or more invariant permutations of the circuit's inputs. These invariant permutations can be used to reduce the number of tests required to fully verify the circuit for all possible input vectors. Once one specific input vector has been verified, there is no need to test other vectors that can be generated by performing any one of the invariant permutations upon the previously verified vector.

Claim (Index 14):
The method of  claim 13 , where f k ( x ) represented by the equation: f k \ue8a0 ( x _ ) = { 0 , x _ = x _ 1 \ue89e 0 n k f k - 1 \ue8a0 ( x _ ) , x _ = x _ 1 \ue89e 1 n k 1 , x _ = 0 n 1 + n 2 + \ue89e \u22ef \ue89e + n k - 1 \ue89e x _ 2 , x _ 2 \u2260 0 n k , 1 n k 0 , x _ = 1 n 1 + n 2 + \ue89e \u22ef \ue89e + n k - 1 \ue89e x _ 2 , x _ 2 \u2260 0 n k , 1 n k 0 , otherwise where the quantum-logic circuit has n inputs that can each assume any of two or more states, where the quantum-logic circuit has one output that can assume any of at least two states, where k is a total number of the two or more non-intersecting subsets, where n i  is a number of inputs in an i th  subset of the two or more non-intersecting subsets, such that (n 1 + . . . +n k )=n, where  x  is an input vector that represents an ordered list of a set of states of the n inputs, where  x1  and  x 2  are vectors that each represent an ordered list of a subset of the set of states of the n inputs, where a length of  x =n, a length of  x 1 =(n 1 + . . . +n k\u22121 ), and a length of  x 2 =n k , where 0 i  represents a string of i zero values, where 1 i  represents a string of i one value, and where f k\u22121 ( x ) is a recursive function call to f( x ) where inputs of the quantum-logic circuit are divided into k\u22121 nonintersecting subsets.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 94.0
- Lexical Diversity: 1.73333
- Patent Class: 714.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15194645', '15194718', '15434867', '13147355', '15147751']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2978133139182606
- 35 USC 102 Novelty (BERT): 0.5642816074925388
- Combined Prediction Score: 0.3244601432756885
- Mean Citation Score: 294.35173
- Max Citation Score: 466.22275
- Similarity Product: 336.07021801149847

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test