Newest 'artificial-intelligence' Questions - Quantum Computing Stack Exchange
Q&A for engineers, scientists, programmers, and computing professionals interested in quantum computing
Q&A for engineers, scientists, programmers, and computing professionals interested in quantum computing
The Kubota Corporation Engine Engineering Department faced a workload surge as it developed a new concept engine, resulting in long waiting times for calculations on its on-premises environment. The department needed a solution that gave it maximum computing power and kept costs…
Today we're excited to showcase HEIR, the latest powerful tool added to our Private Computing Toolkit. HEIR is an open source compiler that unlocks cryptographically-secure private AI inference.Homomorphic encryptionAs new benefits emerge with the growth of AI, balancing privacy…
With the development of big data and artificial intelligence, the technology of urban computing becomes more mature and widely used. In urban computing, using GPS-based trajectory data to discover urban dense areas, extract similar urban trajectories...
Delay-based reservoir computing has gained a lot of attention due to the relative simplicity with which this concept can be implemented in hardware. However,there is still an misconception about the relationship between the delay-time and the input c...
Reservoir computing with optical devices offers an energy-efficient approach for time-series forecasting. Quantum dot lasers with feedback are modelled in this paper to explore the extent to which increased complexity in the charge carrier dynamics w...
Physical systems exhibiting hysteresis are increasingly being used in neuromorphic and in-memory computing research. Generally, the resistance switching of devices with rate-independent hysteresis are being investigated for their use as trainable wei...
In the burgeoning domain of distributed quantum computing, achieving consensus amidst adversarial settings remains a pivotal challenge. We introduce an enhancement to the Quantum Byzantine Agreement (QBA) protocol, uniquely incorporating advanced err...
We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number of inputs...
In computing, time-sharing is the concurrent sharing of a computing resource among many tasks or users by giving each task or user a small slice of processing
Urgent computing is prioritized and immediate access on supercomputers and grids for emergency computations such as severe weather prediction during matters
Amazon Web Services offers reliable, scalable, and inexpensive cloud computing services. Free to join, pay only for what you use.
We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in $\Ot(M^{\w/(\w+1)}n^{(\w^2+3)/(\w+1)})$ time, where $\w < 2.376$ is the exponent of fast matrix multiplication, $n$ is the number of...
To facilitate high quality interaction during the regular use of computing systems, it is essential that the user interface (UI) deliver content and components in an appropriate manner. Although extended reality (XR) is emerging as a new computing pl...
We present a modern C++17-compatible thread pool implementation, built from scratch with high-performance scientific computing in mind. The thread pool is implemented as a single lightweight and self-contained class, and does not have any dependencie...
Adiabatic quantum computing is an analog quantum computing scheme with various applications in solving optimization problems. In the parity picture of quantum optimization, the problem is encoded in local fields that act on qubits which are connected...
[23 Cloud Service Providers Offering Free Tiers: Your Gateway to Cloud Computing Without Breaking the Bank](https://preview.redd.it/ru91foub0smf1.png?width=1474&format=png&auto=webp&s=24d9...
In this addendum, we show that the switching algorithm QPS-SERENA can be converted R(QPS-SERENA), an algorithm for computing approximate Maximum Weight Matching (MWM). Empirically, R(QPS-SERENA) computes $(1-ε)$-MWM within linear time (with respect...
Scientific computing needs are growing dramatically with time and are expanding in science domains that were previously not compute intensive. When compute workflows spike well in excess of the capacity of their local compute resource, capacity shoul...