Microsoft Technology Licensing, LLC

Alexander Vaschillo

Raghavendra Rachamadugu

Bryan T Starbuck

Gail Giacobbe

Stephen Thomas Wells

John Heinrich Lueders

Robert C Combs

Sridhar Sundararaman

Hubert Louis Marie Van Hoof

Bertan Ari

Avner Y Aharoni

Victor E Kozyrev

Sergey Genkin

Andrew Conrad

Adam Wiener

Srinivasa Rao Burugapalli

Alex Laskos

John Carlton Platt

Christopher Andrew Evans

Luca Bolognese

Paul Stephen Hellyar

Chris A Suver

Andrei Burago

Todd F Pfleiger

Scott E Dart

Steve Glenner

Nathaniel Harper Ballou

Randy Knight Winjum

Bradley Phillip Gibson

Bert Van Hoof

Christopher Allen Suver

Michael Pizzo

Michael Lee Brundage

David N Schach

Nicolas Guillaume Delfosse

Vadym Kliuchnikov

Michael Edward Beverland

Steven D White

Michael Eric Deem

Bekim Demiroski

Srinivasmurthy P Acharya

Jennifer P Michelstein

John Patrick Thompson

Denise L Chen

Adam Edward Paetznick

Robert Thompson Whitney

Jason Zhengnan Zhu

Ilker Cengiz

Dmitry Vasilevsky

Eddie Schoute

Andres Paz Sampedro

A computing system is provided, including one or more processing devices. The one or more processing devices are configured to receive quantum circuit parameters including a code parameter of an error correction code and a number of T gates included in a quantum circuit. The one or more processing devices are further configured to receive respective decoder parameters of each of a plurality of candidate decoders. The decoder parameters include a physical noise rate of a plurality of physical qubits at which the quantum circuit is configured to be executed and a stopping time of the candidate decoder. The one or more processing devices are further configured to compute respective spacetime costs of the candidate decoders based on the quantum circuit parameters and the decoder parameters. The one or more processing devices are further configured to output a selection of a lowest-spacetime-cost decoder for implementation at a quantum computing device.

Selecting decoder used at quantum computing device

A method to build a lookup decoder for mapping error syndromes based on quantum-stabilizer code to corresponding error corrections comprises (A) enumerating a subset of error syndromes up to a maximum error weight based on the quantum-stabilizer code; (B) iterating through the subset of error syndromes to compute an error state of highest probability for each error syndrome of the subset, where the error state defines error in a qubit register of a quantum computer; and (C) for each error syndrome of the subset of error syndromes, storing in classical computer memory an error correction based on the error state of highest probability and mapped to that error syndrome.

Construction of lookup decoders for stabilizer codes

A method for performing long-range multi-qubit measurements in a quantum circuit utilizes a graph that maps qubits of the quantum circuit to nodes that are connected to one another by edges. The method provides for identifying sets of the nodes on the graph corresponding to sets of qubits targeted by multi-qubit operations in a quantum algorithm and for defining a group of edge-disjoint paths connecting the nodes of each set. The group of edge-disjoint paths is defined such that no two of the paths in the group share an edge. The method further provides for performing a set of operations to entangle the qubits corresponding to the to the identified set of nodes that are included in each path in the group and for performing the set of multi-qubit operations on the entangled sets of the qubits.

Edge-disjoint paths for long-range multi-qubit operations in quantum circuit

The present invention extends to methods, systems, computer program products, and data structures for efficiently storing and accessing electronic messages representing fax transmissions. The messages are extended according to a fax schema that defines formats for adding fax protocol specific and/or or fax application specific data fields to an electronic message. According to the fax schema, the messages have relationships with other data fields stored using other schemas that define the accounting services, message content, and message participants associated with the fax transmission. The fax schema promotes efficient storage and access of electronic messages representing fax transmissions, while also facilitating integrating messages received by fax transmission with other types of existing message protocols and message applications.

System and method for extending a message schema to represent fax messages

In an Item-based system, Images (e.g., JPEG, TIFF, bitmap, and so on) are treated as core platform objects ('Image Items' or, more simply, 'Images') and exist in an &#x201c;Image Schema&#x201d; that provides an extensible representation of an Image in the system&#x2014;that is, the characteristics of an Image and how that Image relates to other Items (including but not limited to other Images) in the system. To this end, the Image Schema defines the properties, behaviors, and relationships for Images in the system, and the Schema also enforces rules about Images, for example, what data specific Images must contain, what data specific Images may optionally contain, how specific Images can be extended, and so on and so forth.

Systems and methods for the implementation of a digital images schema for organizing units of information manageable by a hardware/software interface system

Architecture that facilitates the calculation of the final margins and positions of all objects in one formatting pass, without the need to reformat an object in the margin neighborhood. Clearance objects, float objects, and empty objects are taken into account. The one-pass algorithm computes the positions of objects on the document due to collapsing margins, determines the sizes of the resulting collapsed margins, and correctly places empty objects, floats, and clearance objects in the document. Clearances due to objects that belong to the neighborhood are processed as well as clearances due to objects outside of the neighborhood.

Collapsing margins in documents with complex content

The principles of the present invention extend to efficiently and reliably providing message related data. Generally, data fields of electronic messages and attachments are created in accordance with an electronic message schema hierarchy. An electronic message can include links to folder items that represent message folders. An electronic message can also include links to contact items that represent message participants. Message applications can register for folder spaces such that each message application is aware of folders that are primarily controlled by other message applications. A link to a contact item can be selected to access current contact related data for a message participant, even when the contact related data has changed since an electronic message containing the link was received.

Efficiently and reliably providing message related data

The present invention extends to methods, systems, computer program products, and data structures for efficiently storing and accessing electronic messages. Generally, electronic messages are created and transformed in accordance with an electronic message schema hierarchy. Electronic messages can be created according to a general message schema that defines a format for data fields that are common to all types of electronic messages (e.g. electronic mail, instant message, fax message). Electronic messages can also be extended according to message extension schemas that define formats for adding protocol specific and/or or application specific data fields to an electronic message. Data fields added in accordance with message extension schemas can differ between electronic messages types. Having some commonly defined fields and other differently defined fields promotes efficient storage and access of electronic messages, while also facilitating message compatibility with existing message protocols and message applications.

Schema hierarchy for electronic messages

Architecture of one or more algorithms for autofitting objects with non-trivial geometries in documents. The algorithms autofit rectangular objects (such as floaters), when the objects contain both left and right aligned objects, autofit tables, determine correct sizes of a parent object and its child object when the width of the parent object is unknown (referred to as an auto-width), and the width of the parent's child object is expressed in percentages of the parent object width. A two-pass algorithm determines the best (or optimal) sizes of margins, borders, and paddings of objects where any combination thereof can have fixed width, auto width, and/or percentage-expressed width. Additionally, the algorithms can recursively calculate the optimal widths of objects inside other objects, where the outer object width is undefined. The algorithms can process an unlimited number of nesting levels.

Optimal sizes of objects in a document

A programming interface for a computer platform can include various functionality. In certain embodiments, the programming interface includes one or more of the following groups of types or functions: those related to core file system concepts, those related to entities that a human being can contact, those related to documents, those common to multiple kinds of media, those specific to audio media, those specific to video media, those specific to image media, those specific to electronic mail messages, and those related to identifying particular locations.

Programming interface for a computer platform

Embodiments relate to systems and methods for formatting a set of expressions in a document. In embodiments, the systems and methods provide the ability to format a set of expressions by aligning expressions or parts of expressions to each other or to the margins of the document, while also supporting breaking of one or more expressions into multiple parts to be placed on different lines. Breaking can include breaking in places requested by a user or breaking in places that are automatically determined to fit the expressions between the margins of a document.

Alignment and breaking of mathematical expressions in documents

A Relational Schema Definition (RSD) language that uses metadata of the relational database to generate an implementation-neutral or implementation-specific format that represents the precise database structure and data. The RSD language is a declarative description language such that an RSD file can then be used offline in a disconnected environment to reconstruct and use the database.

Relational schema format

A system and method for presenting images and related items to a user. A digital image from a data store is assessed, and a portion of the image is defined as a region of interest. Properties are associated with this defined region, and these properties are utilized to infer relationships between the region of interest and related items in the data store. Optionally, a user input indicating a desire to view related content may be received and such content may be presented to the user.

System and method for storing and presenting images and related items to a user

A data mapping architecture for mapping between two or more data sources without modifying the metadata or structure of the data sources themselves. Data mapping also supports updates. The architecture also supports at least the case where data sources that are being mapped, are given, their schemas predefined, and cannot be changed. The architecture includes a mapping component that receives respective metadata from at least two arbitrary data models, and maps expressions between the data models.

Mapping architecture for arbitrary data models

Users and programmers view relational database tables using an schema such as an SQL-annotated XML schema. The schema describes how XML data maps into base tables and fields, including complex one-to-many and many-to-many relationships.

System and method for viewing relational data using a hierarchical schema

Growing community of inventors

Redmond, WA, United States of America

Alexander Vaschillo