Search

Quantum computing has tremendous potential to overcome some of the fundamental limitations present in classical information processing. Yet, today's technological limitations in the quality and scaling prevent exploiting its full potential. Quantum computing based on superconducting quantum processing units (QPUs) is among the most promising approaches towards practical quantum advantage. In this article the basic technological approach of IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. In particular, the focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We also present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.

Large Language Models (LLMs) are capable of transforming natural language domain descriptions into plausibly looking PDDL markup. However, ensuring that actions are consistent within domains still remains a challenging task. In this paper we present a novel concept to significantly improve the quality of LLM-generated PDDL models by performing automated consistency checking during the generation process. Although the proposed consistency checking strategies still can't guarantee absolute correctness of generated models, they can serve as valuable source of feedback reducing the amount of correction efforts expected from a human in the loop. We demonstrate the capabilities of our error detection approach on a number of classical and custom planning domains (logistics, gripper, tyreworld, household, pizza).

In the pursuit of fully autonomous robotic systems capable of taking over tasks traditionally performed by humans, the complexity of open-world environments poses a considerable challenge. Addressing this imperative, this study contributes to the field of Large Language Models (LLMs) applied to task and motion planning for robots. We propose a system architecture that orchestrates a seamless interplay between multiple cognitive levels, encompassing reasoning, planning, and motion generation. At its core lies a novel replanning strategy that handles physically grounded, logical, and semantic errors in the generated plans. We demonstrate the efficacy of the proposed feedback architecture, particularly its impact on executability, correctness, and time complexity via empirical evaluation in the context of a simulation and two intricate real-world scenarios: blocks world, barman and pizza preparation.

We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal number of requests overlapping in time. We also present a simple polynomial-time data reduction algorithm that allows to recover $(1 + {\varepsilon})$-approximate solutions for arbitrary ${\varepsilon} > 0$. It shrinks instances from Microsoft Azure and Huawei Cloud by an order of magnitude for ${\varepsilon} = 0.02$., Comment: Version accepted to Operations Research Letters

The NP-hard Multiple Hitting Set problem is finding a minimum-cardinality set intersecting each of the sets in a given input collection a given number of times. Generalizing a well-known data reduction algorithm due to Weihe, we show a problem kernel for Multiple Hitting Set parameterized by the Dilworth number, a graph parameter introduced by Foldes and Hammer in 1978 yet seemingly so far unexplored in the context of parameterized complexity theory. Using matrix multiplication, we speed up the algorithm to quadratic sequential time and logarithmic parallel time. We experimentally evaluate our algorithms. By implementing our algorithm on GPUs, we show the feasability of realizing kernelization algorithms on SIMD (Single Instruction, Multiple Date) architectures., Comment: Added experiments on one more data set

The rapid development of chargeable devices has caused a great deal of interest in efficient and stable wireless power transfer (WPT) solutions. Most conventional WPT technologies exploit outdated electromagnetic field control methods proposed in the 20th century, wherein some essential parameters are sacrificed in favour of the other ones (efficiency vs. stability), making available WPT systems far from the optimal ones. Over the last few years, the development of novel approaches to electromagnetic field manipulation has enabled many up-and-coming technologies holding great promises for advanced WPT. Examples include coherent perfect absorption, exceptional points in non-Hermitian systems, non-radiating states and anapoles, advanced artificial materials and metastructures. This work overviews the recent achievements in novel physical effects and materials for advanced WPT. We provide a consistent analysis of existing technologies, their pros and cons, and attempt to envision possible perspectives.

Sensor deployments in Smart Homes have long reached commercial relevance for applications such as home automation, home safety or energy consumption awareness and reduction. Nevertheless, due to the heterogeneity of sensor devices and gateways, data integration is still a costly and timeconsuming process. In this paper we propose the Smart Home Crawler Framework that (1) provides a common semantic abstraction from the underlying sensor and gateway technologies, and (2) accelerates the integration of new devices by applying machine learning techniques for linking discovered devices to a semantic data model. We present a first prototype that was demonstrated at ICT 2018. The prototype was built as a domainspecific crawling component for IoTCrawler, a secure and privacy-preserving search engine for the Internet of Things., Comment: 2019 Global IoT Summit (GIoTS)

The known linear-time kernelizations for $d$-Hitting Set guarantee linear worst-case running times using a quadratic-size data structure (that is not fully initialized). Getting rid of this data structure, we show that problem kernels of asymptotically optimal size $O(k^d)$ for $d$-Hitting Set are computable in linear time and space. Additionally, we experimentally compare the linear-time kernelizations for $d$-Hitting Set to each other and to a classical data reduction algorithm due to Weihe., Comment: More detailed algorithm descriptions, extended experimental section

We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted $n$-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. On the negative side, we show that $o(\log n)$-approximating the difference $d$ between the optimal solution cost and a natural lower bound is NP-hard and that, under the Exponential Time Hypothesis, there are no exact algorithms running in $2^{o(n)}$ time or in $f(d)\cdot n^{O(1)}$ time for any computable function $f$. Moreover, we show that the special case of connecting $c$ network components with minimum additional cost generally cannot be polynomial-time reduced to instances of size $c^{O(1)}$ unless the polynomial-time hierarchy collapses. On the positive side, we provide an algorithm that reconnects $O(\log n)$ connected components with minimum additional cost in polynomial time. These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several connected components due to sensor faults. In experiments, the algorithm outperforms CPLEX with known ILP formulations when $n$ is sufficiently large compared to $c$., Comment: Additional experiments, lower bounds strengthened to metric case, added kernelization lower bounds

The existing approaches for scientific workflows composition face the problems of domain knowledge integration. By this paper we summarize the results, which have been elaborated and implemented during the 2-year research concerning to Virtual Simulation Objects (VSO) concept and technology development. The contribution of this paper consists of formal models of the VSO internal structures and user-assistance logic, which may be obtained as a result of the reasoning over knowledge base. (This paper was rejected to appear in "Recent Advances in Knowledge Based Technologies and Applications" by Hindawi in 2014, but was stolen and published by Ke Han under the name "The Study on Workflows Composition Based on Virtual Simulation Objects Technology")

Presented paper describes the development of comprehensive approach for knowledge processing within e-Sceince tasks. Considering the task solving within a simulation-driven approach a set of knowledge-based procedures for task definition and composite application processing can be identified. This procedures could be supported by the use of domain-specific knowledge being formalized and used for automation purpose. Within this work the developed conceptual and technological knowledge-based toolbox for complex multidisciplinary task solv-ing support is proposed. Using CLAVIRE cloud computing environment as a core platform a set of interconnected expressive technologies were developed., Comment: Proceedings of the 8th International Conference on Intelligent Systems and Knowledge Engineering (ISKE2013). 2013

This paper presents Virtual Simulation Objects (VSO) concept which forms theoretical basis for building tools and framework that is developed for system-level simulations using existing software modules available within cyber-infrastructure. Presented concept is implemented by the software tool for building composite solutions using VSO-based GUI and running them using CLAVIRE simulation environment., Comment: Proceedings of IEEE e-Sceince Conference. 2012. CD-ROM. ISBN 978-1-4673-4465-4