Abstract: Monoclonal antibodies and antigen binding fragments that specifically bind pneumococcal proteins, specifically pneumococcal histidine triad protein (PhtD) and pneumococcal surface protein A (PspA), are provided. Also disclosed are nucleic acid molecules encoding the antibody, antigen binding fragment, a VH or VL of the antibody, or a multipiece antibody including the VH and/or VL, vectors including these nucleic acid molecules, and host cells transfected with these vectors. Methods of inhibiting, treating, and detecting a Streptococcus pneumoniae infection are also provided.

Abstract: Systems and methods are disclosed for benchmarking a set of quantum gates. The set of quantum gates can have an input domain and a fidelity function defined over this input domain. Benchmarking the set of quantum gates can include determining an approximate value of the fidelity function over the input domain. Such benchmarking can include determining multiple fidelity measures. Each fidelity measure can be associated with one of a set of basis functions. This basis function can be used to generate a probability distribution. The probability distribution can be used to determine the fidelity measure. The approximate fidelity function can be generated using the fidelity measures and corresponding basis functions.

Abstract: Systems and methods are disclosed for benchmarking a set of quantum gates. Consistent with disclosed embodiments, a benchmarking method can include obtaining a sequence of M quantum gates from a group of quantum gates according to a probability distribution. The quantum gates in the group can be capable of polynomial-time classical simulation. The method can further include obtaining an outcome measure by applying the sequence of M quantum gates to N qubits of a quantum computing device and obtaining a probability of obtaining the outcome value given the application of the selected sequence of quantum gates. The probability can be obtained using classical simulation of the selected sequence of quantum gates. A fidelity benchmark for the M quantum gates can be generated based at least in part on the obtained probability.

Abstract: Methods, apparatuses, and systems include: based on a parameter of a quantum gate, generating representations of m1 random unitary quantum gates; determining a representation of a first quantum-gate sequence equivalent to an identity operator; determining a representation of a second quantum-gate sequence equivalent to the identity operator; sending, to a quantum computing device, hardware instructions corresponding to the representation of the first quantum-gate sequence the second quantum-gate sequence; receiving a first number of measurements of a qubit after applying the first quantum-gate sequence to the qubit for the first number of times by the quantum computing device and a second number of measurements of the qubit after applying the second quantum-gate sequence to the qubit for the second number of times by the quantum computing device; and determining a fidelity value of the quantum gate based on a first probability and a second probability.

Abstract: One embodiment described herein provides a system and method for simulating behavior of a quantum circuit that includes a plurality of quantum gates. During operation, the system receives information that represents the quantum circuit and constructs an undirected graph corresponding to the quantum circuit. A respective vertex within the undirected graph corresponds to a distinct variable in a Feynman path integral used for computing amplitude of the quantum circuit, and a respective edge corresponds to one or more quantum gates. The system identifies a vertex within the undirected graph that is coupled to at least two two-qubit quantum gates; simplifies the undirected graph by removing the identified vertex, thereby effectively removing the two-qubit quantum gates coupled to the identified vertex; and evaluates the simplified undirected graph, thereby facilitating simulation of the behavior of the quantum circuit.

Abstract: Systems and methods are provided for implementing arbitrary single-qubit quantum gates using sequences of single-qubit quantum gates. The systems and methods can implement a first quantum gate in a gate sequence by applying a first sequence of phase-shifted pulses to the qubit. After applying the first quantum gate, a second quantum gate in the gate sequence can be implemented by applying a second sequence of phase-shifted pulses to the qubit. The implementation of the second quantum gate can introduce an additional rotation. This additional rotation can be independent of the implementation of the first quantum gate. A pulse in the second sequence can be configured to implement: a virtual Z gate having a first rotation angle; an X gate having a second rotation angle; and the virtual Z gate having a negative of the first rotation angle.

Abstract: Antibodies and antigen binding fragments that specifically bind to human metapneumovirus (hMPV) F protein and neutralize hMPV are disclosed. Nucleic acids encoding these antibodies, vectors and host cells are also provided. The disclosed antibodies, antigen binding fragments, nucleic acids and vectors can be used, for example, to inhibit an hMPV infection or detect a hMPV infection.

Abstract: Systems, methods, and computer readable media for performing a quantum computation are disclosed. An exemplary system can include a quantum component and a classical component. The classical component can be configured to perform operations. The operations can include obtaining a description of a quantum computational task, generating a gate sequence implementing the quantum computational task, providing commands applying the gate sequence to the quantum component. and obtaining an output from the quantum component. Generation of the gate sequence can include identifying, in the gate sequence, a two-qubit gate applied to two qubits, determining a decomposition sequence that implements the two-qubit gate using at least one square root of iSWAP (SQiSW) gate and at least one single-qubit gate, and including the decomposition sequence in the gate sequence in place of the two-qubit gate.

Abstract: Systems and methods for performing iFRB benchmarking are disclosed. Exemplary systems can include a quantum component and a classical component. The classical component can include at least one processor and at least one non-transitory computer-readable medium. The non-transitory computer-readable medium can contain instructions that, when executed by the at least one processor, cause the classical component to perform operations. The operations can include generating a gate sequence including test gates interleaved with gate subsequences equivalent to Haar random two-qubit gates. Each gate subsequence can include at least one SQiSW gate. The operations can further include generating a recovery gate based on the gate sequence. The operations can further include providing commands applying the gate sequence and the recovery gate to the quantum component and obtaining an output from the quantum component.

Abstract: Methods, apparatuses, and systems include: based on a parameter of a quantum gate, generating representations of m1 random unitary quantum gates; determining a representation of a first quantum-gate sequence equivalent to an identity operator; determining a representation of a second quantum-gate sequence equivalent to the identity operator; sending, to a quantum computing device, hardware instructions corresponding to the representation of the first quantum-gate sequence the second quantum-gate sequence; receiving a first number of measurements of a qubit after applying the first quantum-gate sequence to the qubit for the first number of times by the quantum computing device and a second number of measurements of the qubit after applying the second quantum-gate sequence to the qubit for the second number of times by the quantum computing device; and determining a fidelity value of the quantum gate based on a first probability and a second probability.

Abstract: Methods, apparatuses, and systems include: based on a parameter of a quantum gate, generating representations of mi random unitary quantum gates; determining a representation of a first quantum-gate sequence equivalent to an identity operator; determining a representation of a second quantum-gate sequence equivalent to the identity operator; sending, to a quantum computing device, hardware instructions corresponding to the representation of the first quantum-gate sequence the second quantum-gate sequence; receiving a first number of measurements of a qubit after applying the first quantum-gate sequence to the qubit for the first number of times by the quantum computing device and a second number of measurements of the qubit after applying the second quantum-gate sequence to the qubit for the second number of times by the quantum computing device; and determining a fidelity value of the quantum gate based on a first probability and a second probability.

Abstract: One embodiment described herein provides a system and method for simulating behavior of a quantum circuit that includes a plurality of quantum gates. During operation, the system receives information that represents the quantum circuit and constructs an undirected graph corresponding to the quantum circuit. A respective vertex within the undirected graph corresponds to a distinct variable in a Feynman path integral used for computing amplitude of the quantum circuit, and a respective edge corresponds to one or more quantum gates. The system identifies a vertex within the undirected graph that is coupled to at least two two-qubit quantum gates; simplifies the undirected graph by removing the identified vertex, thereby effectively removing the two-qubit quantum gates coupled to the identified vertex; and evaluates the simplified undirected graph, thereby facilitating simulation of the behavior of the quantum circuit.

Abstract: Methods and systems for tensor network contraction are provided. A method implemented by a computing host comprises obtaining a contraction tree associated with a tensor network, wherein a plurality of vertices and edges of the contraction tree correspond to a set of tensor nodes and indices of the tensor network, respectively; iteratively performing operations until a termination condition is satisfied, the operations including selecting a sub-graph of the contraction tree; replacing the sub-graph with a local optimal sub-graph; and obtaining an optimized contraction tree including the local optimal sub-graph; and outputting the optimized contraction tree.

Abstract: Methods and systems for tensor network contraction are provided. A method implemented by a computing host includes obtaining a plurality of tensor nodes associated with a tensor network and a plurality of indices respectively associated with the plurality of tensor nodes; generating a graph associated with the tensor network, wherein the plurality of tensor nodes correspond to a plurality of vertices of the graph and the plurality of indices correspond to a plurality of edges of the graph, respectively; decomposing the graph into a plurality of sub-graphs; and for each sub-graph of the plurality of sub-graphs, iteratively decomposing a current sub-graph into a plurality of next-tier sub-graphs until a size of each of the plurality of next-tier sub-graphs is less than a pre-set threshold.

Abstract: One embodiment described herein provides a system and method for simulating behavior of a quantum circuit that includes a plurality of quantum gates. During operation, the system receives information that represents the quantum circuit and constructs an undirected graph corresponding to the quantum circuit. A respective vertex within the undirected graph corresponds to a distinct variable in a Feynman path integral used for computing amplitude of the quantum circuit, and a respective edge corresponds to one or more quantum gates. The system identifies a vertex within the undirected graph that is coupled to at least two two-qubit quantum gates; simplifies the undirected graph by removing the identified vertex, thereby effectively removing the two-qubit quantum gates coupled to the identified vertex; and evaluates the simplified undirected graph, thereby facilitating simulation of the behavior of the quantum circuit.

Abstract: Embodiments of the disclosure provide method for performing contraction on a tensor network. The method can include: receiving, by a system, a tensor network comprising a plurality of tensors and a plurality of edges among the plurality of tensors, wherein each edge is associated with a plurality of index elements; determining a contraction order of the tensor network; determining, among the plurality of edges, one or more edges for generating a plurality of sub-networks based on the tensor network; and distributing the plurality of sub-networks to a plurality of computing nodes of the system to perform, by the plurality of computing nodes, contraction on the plurality of sub-networks based on the contraction order.

Abstract: One embodiment described herein provides a system and method for simulating behavior of a quantum circuit that includes a plurality of quantum gates. During operation, the system receives information that represents the quantum circuit and constructs an undirected graph corresponding to the quantum circuit. A respective vertex within the undirected graph corresponds to a distinct variable in a Feynman path integral used for computing amplitude of the quantum circuit, and a respective edge corresponds to one or more quantum gates. The system identifies a vertex within the undirected graph that is coupled to at least two two-qubit quantum gates; simplifies the undirected graph by removing the identified vertex, thereby effectively removing the two-qubit quantum gates coupled to the identified vertex; and evaluates the simplified undirected graph, thereby facilitating simulation of the behavior of the quantum circuit.