The task of issue resolving aims to modify a codebase to generate a patch that addresses a given issue. However, most existing benchmarks focus almost exclusively on Python, making them insufficient for evaluating Large Language Models (LLMs) across different programming languages. To bridge this gap, we introduce a multilingual issue-resolving benchmark, called Multi-SWE-bench, covering 8 languages of Python, Java, TypeScript, JavaScript, Go, Rust, C, and C++. In particular, this benchmark includes a total of 2,132 high-quality instances, carefully curated by 68 expert annotators, ensuring a reliable and accurate evaluation of LLMs on the issue-resolving task. Based on human-annotated results, the issues are further classified into three difficulty levels. We evaluate a series of state-of-the-art models on Multi-SWE-bench, utilizing both procedural and agent-based frameworks for issue resolving. Our experiments reveal three key findings: (1) Limited generalization across languages: While existing LLMs perform well on Python issues, their ability to generalize across other languages remains limited; (2) Performance aligned with human-annotated difficulty: LLM-based agents' performance closely aligns with human-assigned difficulty, with resolution rates decreasing as issue complexity rises; and (3) Performance drop on cross-file issues: The performance of current methods significantly deteriorates when handling cross-file issues. These findings highlight the limitations of current LLMs and underscore the need for more robust models capable of handling a broader range of programming languages and complex issue scenarios.

Xinying Qiu, Yuan Chen, Hanwu Chen, Jian-Yun Nie, Yuming Shen, Dawei Lu. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). 2021.

Cloud computing is a powerful and popular information technology paradigm that enables data service outsourcing and provides higher-level services with minimal management effort. However, it is still a key challenge to protect data privacy when a user accesses the sensitive cloud data. Privacy-preserving database query allows the user to retrieve a data item from the cloud database without revealing the information of the queried data item, meanwhile limiting user’s ability to access other ones. In this study, in order to achieve the privacy preservation and reduce the communication complexity, a quantum-based database query scheme for privacy preservation in cloud environment is developed. Specifically, all the data items of the database are firstly encrypted by different keys for protecting server’s privacy, and in order to guarantee the clients’ privacy, the server is required to transmit all these encrypted data items to the client with the oblivious transfer strategy. Besides, two oracle operations, a modified Grover iteration, and a special offset encryption mechanism are combined together to ensure that the client can correctly query the desirable data item. Finally, performance evaluation is conducted to validate the correctness, privacy, and efficiency of our proposed scheme.

In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, the quantum Reiger bound (QRB). Secondly, we propose two constructions of QBECCs: one by heuristic computer search and the other by concatenating two quantum tensor product codes (QTPCs). We obtain several new QBECCs with better parameters than existing codes with the same coding length. Moreover, some of the constructed codes can saturate the quantum Reiger bounds. Finally, we perform numerical experiments for our constructed codes over Markovian correlated depolarizing quantum memory channels, and show that QBECCs indeed outperform standard QECCs in this scenario.

In the works of Maucher et al. (200), Bossert et al. (1999) and GrieBer (2003), the authors presented the equivalence of generalized concatenated codes (GCC codes) and generalized error-location codes (GEL codes). However, they find that there exist several errors. In this work, the authors give several corrections to the work of Maucher et al. (2000) and make some amendments to Theorems 2 and 3 , but without affecting the equivalence of the class of GCC codes and the class of GEL codes. The authors give corrected proofs to the amended Theorems 2 and 3, respectively. Then, they conclude that the class of GCC codes is still equivalent to the class of GEL codes.

In this paper, we construct asymmetric quantum error-correcting codes(AQCs) based on subclasses of Alternant codes. Firstly, We propose a new subclass of Alternant codes which can attain the classical Gilbert-Varshamov bound to construct AQCs. It is shown that when dx= 2, Z-parts of the AQCs can attain the classical Gilbert-Varshamov bound. Then we construct AQCs based on a famous subclass of Alternant codes called Goppa codes. As an illustrative example, we get three [[55, 6, 19/4]], [[55, 10, 19/3]], [[55, 15, 19/2]] AQCs from the well known [55, 16, 19] binary Goppa code. At last, we get asymptotically good binary expansions of asymmetric quantum GRS codes, which are quantum generalizations of Retter's classical results. All the AQCs constructed in this paper are pure.

This article presents an algorithm which can quickly find the exact minimum solution to almost all of 4-bit reversible functions. We assume minimization of quantum cost (MQC). This algorithm is designed in the most memory-efficient way, or it will quickly run out of memory. Therefore, we construct the shortest coding of permutations, the topological compression and flexible data structures for the memory savings. First, hash tables are used for all 8-gate 4-bit circuits with the minimization of gate count (MGC) by using the GT library (with NOT, CNOT, Toffoli and Toffoli-4 gates). Second, we merge and split the hash tables, thus generating a single longer hash table for high-performance. Third, we synthesize these circuits with MQC by using the GTP library (with GT, Peres, and Inverted Peres gates) based on the hash table. Finally, according to the comparison of the QC of circuits, the algorithm can quickly converge for any 4-bit reversible circuit with MQC. By synthesizing all benchmark functions, in comparison with Szyprowski and Kerntopf [2011], the running time and QC are reduced up to 99.95% and 18.2%, respectively.

A deterministic secure quantum communication (DSQC) scheme with mutual authentication is proposed, where unitary operations are not necessary, while they are indispensable in other quantum direct communication (QDC) schemes. Since the realization of a unitary operation is not a simple task in quantum computation and quantum communication, it simplifies the implementation of QDC schemes to a great extent. The scheme is partitioned into two parts, mutual authentication and direct communication. To authenticate identities of the two users, an authentication strategy is put forward by utilizing the property of Bell states in which unitary is not performed. In direct communication phase, Alice and Bob can communicate directly and deterministically without any unitary operation due to the property of entanglement swapping. Naturally, the security of the presented DSQC scheme is discussed in detail. Compared with the previous QDC protocols, the proposed DSQC scheme has some meaningful advantages.

A novel practical quantum secret sharing protocol is proposed to share a private key between one and many parties based on four single-qubit states. The qubit capacity of this protocol is high due to the absence of bitwise exclusive OR of qubits' measuring results. It is also feasible with present-day technology, even when a great many participants are engaged, and secure against several common attacks. Besides, this protocol can be directly extended to deal with the many-to-many situation.

By reviewing the original INIQGA algorithm, an improved algorithm (IINIQGA) is put forward by revising the lookup table. In addition, By introducing the variable angle-distance rotation method into the update Q(t) procedure, a novel quantum-inspired evolutionary algorithm, QEA-VAR, was proposed. Compared with previous algorithms, our update Q(t) procedure is more simple and feasible. Finally, the corresponding experiments on the 0-1 knapsack problem were carried out, and the results show that our improvement is efficient, and comparing with IINIQGA, QEA, and CGA, QEA-VAR has a faster convergence and better profits than other algorithms.

Quantum reversible logic circuits synthesis is one of the key technologies to construct quantum computer. The algebraic model for quantum information processing is a unitary matrix operator. Matrix can better reflect the quantum state evolution and the properties of quantum computation. Bidirectional matrix-based algorithm for quantum reversible logic circuits synthesis is proposed in this paper. The matrix representation of quantum reversible circuit and the circuit transformation rules of adjacent matrix are employed to construct any quantum reversible circuit in this paper. Compared with, the computational complexity of our algorithm has been decreased exponentially and the speed has been increased by about 105times. In addition, the types of the quantum reversible circuits synthesized by our algorithm are extended from only even permutations in to even and odd ones. we have synthesized 13!=6227020800 quantum reversible circuits, which can't be done by other algorithms.

We propose an efficient quantum secret sharing scheme with orthogonal product states in the 3×3 Hilbert space. Different from Hsu and Li's scheme [Phys. Rev. A 71, 022321 (2005)], this scheme utilizes a novel distribution strategy which sends the qutrits of basis states and superpositions to two separated observers respectively. The theoretical analysis shows that the intrinsic efficiency for qutrits in this scheme approaches 100% and the total efficiency of this scheme is higher than that of the aforementioned scheme. Furthermore, the security and some possible eavesdropping strategies are also examined in this paper.

Owing to the exponential nature of the memory or run-tune complexity, many existing methods can only synthesize 3-qubit circuits, however, (G.W. Yang et al., 2005) can achieve 12 steps for the CNP (controlled-Not gate, NOT gate and Peres gate) library in 4-qubit circuit synthesis with mini-length by using an enhanced bi-directional synthesis approach. We mainly absorb the ideas of our 3-qubit synthesis algorithms based on hash table and present a novel and efficient algorithm which can construct almost all optimal 4-qubit reversible logic circuits with various types of gates and mini-length cost based on constructing the shortest coding and the specific topological compression, whose lossless compression ratios of the space of n-qubit circuits is near 2timesn!. Our algorithm has created all 3120218828 optimal 4-qubit circuits whose length is less than 9 for the CNT (Toffoli gate) library, and it can quickly achieve 16 steps through cascading created circuits. To the best of our knowledge, there are no other algorithms to achieve the contribution.

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73, 042305(2006)], proposed by Lee, Lim and Yang, recently were indicated to be insecure against the authenticator Trentpsilas attacks [Phys. Rev. A 75, 026301(2007)]. In this paper, two novel efficient protocols of quantum direct communication with authentication are presented by utilizing four kinds of Pauli operations (I, sigmax, isigmay, sigmaz). These new protocols can transmit two bits message every GHZ state, instead of one bit in the aforementioned protocols. Analysis shows that they are secure against the inner participantpsilas attacks (such as Trentpsilas attacks) as well as the outer Evepsilas attacks. Finally, we generalize them to multiparty quantum direction communication.

To ensure the validity and reliability of reversible circuits, fault detection is necessarily. Two methods to get complete test set with respect to missing-gate fault (MGF) in reversible circuits were introduced. They are the method that divided the circuit into subcircuit to get the complete test set which is not minimal and the set covering method to get the minimal complete test set. Comparing to DFT detection method, the methods introduced in this paper do not need additional gates; they do not change the structure of the circuits and do not depend on implement technologies. So, it can be widely applied.

To improve the technique of optimizing reversible logic circuit and reduce the cost of reversible logic circuit, the template technology is analyzed, finding that Maslov's templates are incomplete in that the control lines are incomplete. By introducing the library of template control lines concept, templates are reconstructed and named semi-template. The semi-templates do not realize the identity function, but more valid templates can be produced dynamically using template producing rule. And based on this method, an algorithm is provided to optimize reversible logic circuit. Experimental data show that this method is more efficient and has higher rate of matching success in optimizing reversible logic circuit.

For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.

Ontology-based information retrieval is precise and effective but suffers from the problem of ontology heterogeneity. This paper focuses on the approximate information retrieval approach to solve the heterogeneity problem of both common ontologies as well as fuzzy ontologies on the semantic Web. Approximate information retrieval needs to find approximations of concepts. However, current methods cannot find the best approximations of concepts for common ontologies, and there is still no published work for fuzzy ontologies. This paper firstly proposes a method of approximate information retrieval between common ontologies. It defines multielement least upper bounds and multielement greatest lower bounds, and then simplifies the multielement bounds to remove redundancy. It provides effective algorithms to find the simplified multielement bounds, and get the best approximations of concepts from the bounds. Then for the fuzzy ontologies, the paper defines cut concepts to transform fuzzy concepts into common concepts, and then applies the proposed method for approximate information retrieval between fuzzy ontologies. The improved algorithms for fuzzy ontologies are given to make the method more feasible and effective.

Reasonable analysis and corrective measurement for the testing results of Web applications can effectively judge the effect and efficiency of the testing. Therefore, based on the previous work, we propose a new method for testing results analysis and comparison, which uses the semantic label and XML description technique to realize the information separation between data and display in the Web pages, so as to directly compare the testing results and the expected results. Furthermore, combined with the realities, we determine the metric indexes of Web application testing, so as to provide the criterions and guidelines for the evaluations of the Web applications and their testing processes. And we introduce the feedback control mechanism into the development and evolvement of Web applications, so as to further improve the system quality.