2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)最新文献

筛选
英文 中文
RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing Simulation 用于核外量子计算模拟的块张量代数库
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00004
Sergio Sánchez Ramírez, Javier Conejero, F. Lordan, A. Queralt, Toni Cortes, R. Badia, A. García-Sáez
{"title":"RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing Simulation","authors":"Sergio Sánchez Ramírez, Javier Conejero, F. Lordan, A. Queralt, Toni Cortes, R. Badia, A. García-Sáez","doi":"10.1109/QCS54837.2021.00004","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00004","url":null,"abstract":"With the advent of more powerful Quantum Computers, the need for larger Quantum Simulations has boosted. As the amount of resources grows exponentially with size of the target system Tensor Networks emerge as an optimal framework with which we represent Quantum States in tensor factorizations. As the extent of a tensor network increases, so does the size of intermediate tensors requiring HPC tools for their manipulation. Simulations of medium-sized circuits cannot fit on local memory, and solutions for distributed contraction of tensors are scarce. In this work we present RosneT, a library for distributed, out-of-core block tensor algebra. We use the PyCOMPSs programming model to transform tensor operations into a collection of tasks handled by the COMPSs runtime, targeting executions in existing and upcoming Exascale supercomputers. We report results validating our approach showing good scalability in simulations of Quantum circuits of up to 53 qubits.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132428997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Scalable Programming Workflows for Validation of Quantum Computers 量子计算机验证的可扩展编程工作流
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00013
Thien Nguyen, Lindsay Bassman, Dmitry I. Lyakh, Phillip C. Lotshaw, A. McCaskey, R. Bennink, Vicente Leyton-Ortega, R. Pooser, T. Humble, W. D. de Jong
{"title":"Scalable Programming Workflows for Validation of Quantum Computers","authors":"Thien Nguyen, Lindsay Bassman, Dmitry I. Lyakh, Phillip C. Lotshaw, A. McCaskey, R. Bennink, Vicente Leyton-Ortega, R. Pooser, T. Humble, W. D. de Jong","doi":"10.1109/QCS54837.2021.00013","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00013","url":null,"abstract":"Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121370515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
HybridQ: A Hybrid Simulator for Quantum Circuits HybridQ:量子电路的混合模拟器
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00015
S. Mandrà, Jeffrey Marshall, E. Rieffel, R. Biswas
{"title":"HybridQ: A Hybrid Simulator for Quantum Circuits","authors":"S. Mandrà, Jeffrey Marshall, E. Rieffel, R. Biswas","doi":"10.1109/QCS54837.2021.00015","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00015","url":null,"abstract":"Developing state-of-the-art classical simulators of quantum circuits is of utmost importance to test and evaluate early quantum technology and understand the true potential of full-blown error-corrected quantum computers. In the past few years, multiple theoretical and numerical advances have continuously pushed the boundary of what is classically simulable, hence the development of a plethora of tools which are often limited to a specific purpose or designed for a particular hardware (e.g. CPUs vs. GPUs). Moreover, such tools are typically developed using tailored languages and syntax, which makes it hard to compare results from, and create hybrid approaches using, different simulation techniques. To support unified and optimized use of these techniques across platforms, we developed HybridQ , a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to run on a variety of hardware. The philosophy behind its development has been driven by three main pillars: Easy to Use, Easy to Extend, and Use the Best Available Technology. The powerful tools of HybridQ allow users to manipulate, develop, and extend noiseless and noisy circuits for different hardware architectures. HybridQ supports large-scale high-performance computing (HPC) simulations, automatically balancing workload among different processor nodes and enabling the use of multiple backends to maximize parallel efficiency. Everything is then glued together by a simple and expressive language that allows seamless switching from one technique to another as well as from one hardware to the next, without the need to write lengthy translations, thus greatly simplifying the development of new hybrid algorithms and techniques.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Large scale multi-node simulations of ℤ2 gauge theory quantum circuits using Google Cloud Platform 基于Google云平台的2规范理论量子电路的大规模多节点模拟
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00012
Erik J. Gustafson, B. Holzman, J. Kowalkowski, Henry Lamm, A. Li, G. Perdue, S. Isakov, O. Martin, R. Thomson, J. Beall, M. Ganahl, G. Vidal, E. Peters
{"title":"Large scale multi-node simulations of ℤ2 gauge theory quantum circuits using Google Cloud Platform","authors":"Erik J. Gustafson, B. Holzman, J. Kowalkowski, Henry Lamm, A. Li, G. Perdue, S. Isakov, O. Martin, R. Thomson, J. Beall, M. Ganahl, G. Vidal, E. Peters","doi":"10.1109/QCS54837.2021.00012","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00012","url":null,"abstract":"Simulating quantum field theories on a quantum computer is one of the most exciting fundamental physics applications of quantum information science. Dynamical time evolution of quantum fields is a challenge that is beyond the capabilities of classical computing, but it can teach us important lessons about the fundamental fabric of space and time. Whether we may answer scientific questions of interest using near-term quantum computing hardware is an open question that requires a detailed simulation study of quantum noise. Here we present a large scale simulation study powered by a multi-node implementation of qsim using the Google Cloud Platform. We additionally employ newly-developed GPU capabilities in qsim and show how Tensor Processing Units — Application-specific Integrated Circuits (ASICs) specialized for Machine Learning — may be used to dramatically speed up the simulation of large quantum circuits. We demonstrate the use of high performance cloud computing for simulating ℤ2 quantum field theories on system sizes up to 36 qubits. We find this lattice size is not able to simulate our problem and observable combination with sufficient accuracy, implying more challenging observables of interest for this theory are likely beyond the reach of classical computation using exact circuit simulation.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123913834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design QuantumCircuitOpt:一个可证明的最优量子电路设计的开源框架
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00010
Harsha Nagarajan, Owen Lockwood, Carleton Coffrin
{"title":"QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design","authors":"Harsha Nagarajan, Owen Lockwood, Carleton Coffrin","doi":"10.1109/QCS54837.2021.00010","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00010","url":null,"abstract":"In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled state, represented as a unitary, into a quantum circuit, that is, a sequence of gates supported by a quantum processor. It has been well known that circuits with longer decompositions and more entangling multi-qubit gates are error-prone for the current noisy, intermediate-scale quantum devices. To this end, there has been a significant interest to develop heuristic-based methods to discover compact circuits. We contribute to this effort by proposing QuantumCircuitOpt (QCOpt), a novel open-source framework which implements mathematical optimization formulations and algorithms for decomposing arbitrary unitary gates into a sequence of hardware-native gates. A core innovation of QCOpt is that it provides optimality guarantees on the quantum circuits that it produces. In particular, we show that QCOpt can find up to 57% reduction in the number of necessary gates on circuits with up to four qubits, and in run times less than a few minutes on commodity computing hardware. We also validate the efficacy of QCOpt as a tool for quantum circuit design in comparison with a naive brute-force enumeration algorithm. We also show how the QCOpt package can be adapted to various built-in types of native gate sets, based on different hardware platforms like those produced by IBM, Rigetti and Google. We hope this package will facilitate further algorithmic exploration for quantum processor designers, as well as quantum physicists.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124123850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Mapping Constraint Problems onto Quantum Gate and Annealing Devices 量子门和退火器件上的映射约束问题
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00016
E. Wilson, F. Mueller, S. Pakin
{"title":"Mapping Constraint Problems onto Quantum Gate and Annealing Devices","authors":"E. Wilson, F. Mueller, S. Pakin","doi":"10.1109/QCS54837.2021.00016","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00016","url":null,"abstract":"This work presents NchooseK, a unified programming model for constraint satisfaction problems that can be mapped to both quantum circuit and annealing devices through Quadratic Unconstrained Binary Operators (QUBOs). Our mapping provides an approachable and effective way to program both types of quantum computers. We provide examples of NchooseK being used.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"453 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123050186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs 基于gpu的QTensor量子电路模拟器的性能评估与加速
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00007
Danylo Lykov, Angela Chen, Huaxuan Chen, Kristopher Keipert, Zheng Zhang, Tom Gibbs, Y. Alexeev
{"title":"Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs","authors":"Danylo Lykov, Angela Chen, Huaxuan Chen, Kristopher Keipert, Zheng Zhang, Tom Gibbs, Y. Alexeev","doi":"10.1109/QCS54837.2021.00007","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00007","url":null,"abstract":"This work studies the porting and optimization of the tensor network simulator QTensor on GPUs, with the ultimate goal of simulating quantum circuits efficiently at scale on large GPU supercomputers. We implement NumPy, PyTorch, and CuPy backends and benchmark the codes to find the optimal allocation of tensor simulations to either a CPU or a GPU. We also present a dynamic mixed backend to achieve optimal performance. To demonstrate the performance, we simulate QAOA circuits for computing the MaxCut energy expectation. Our method achieves 176× speedup on a GPU over the NumPy baseline on a CPU for the benchmarked QAOA circuits to solve MaxCut problem on a 3-regular graph of size 30 with depth p = 4.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126987870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Exploring Affine Abstractions for Qubit Mapping 探索量子比特映射的仿射抽象
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00009
Blake Gerard, Martin Kong
{"title":"Exploring Affine Abstractions for Qubit Mapping","authors":"Blake Gerard, Martin Kong","doi":"10.1109/QCS54837.2021.00009","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00009","url":null,"abstract":"One of the key compilation steps in Quantum Computing (QC) is to determine an initial logical to physical mapping of the qubits used in a quantum circuit. The impact of the starting qubit layout can vastly affect later scheduling and placement decisions of QASM operations, yielding higher values on critical performance metrics (gate count and circuit depth) as a result of a quantum compilers introducing communication operations to meet the underlying physical neighboring and connectivity constraints of the quantum device.We present our ongoing work on qubit mapping with affine abstractions, which aims to compute effective initial qubit layouts. The key assumption is that the quantum program is represented in an affine representation, a property which permits us to apply aggressive program analyses to determine the potential of sharing qubit accesses among groups of quantum operations prescribed by linear and affine relations. We present preliminary results demonstrating the effectiveness of our novel approach on 69 quantum circuits, while using the QISKIT compiler on IBM Tokyo and Google Sycamore, obtaining between 16% and 21% average improvement on circuit depth and 24%–47% improvement on the number of added gates.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130102030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Illinois Express Quantum Network for Distributing and Controlling Entanglement on Metro-Scale 在地铁尺度上分配和控制纠缠的伊利诺伊快车量子网络
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-11-01 DOI: 10.1109/QCS54837.2021.00008
Wenji Wu, Joaquín Chung, G. Kanter, N. Lauk, Raju Valivarthi, Russell R. Ceballos, C. Peña, N. Sinclair, Jordan M. Thomas, Ely M. Eastman, S. Xie, R. Kettimuthu, Premjeet Kumar, P. Spentzouris, M. Spiropulu
{"title":"Illinois Express Quantum Network for Distributing and Controlling Entanglement on Metro-Scale","authors":"Wenji Wu, Joaquín Chung, G. Kanter, N. Lauk, Raju Valivarthi, Russell R. Ceballos, C. Peña, N. Sinclair, Jordan M. Thomas, Ely M. Eastman, S. Xie, R. Kettimuthu, Premjeet Kumar, P. Spentzouris, M. Spiropulu","doi":"10.1109/QCS54837.2021.00008","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00008","url":null,"abstract":"We describe an implementation of a quantum network over installed fiber in the Chicago area. We present network topology and control architecture of this network and illustrate preliminary results for quantum teleportation and coexistence of quantum and classical data on the same fiber link.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"59 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Quandary: An open-source C++ package for high-performance optimal control of open quantum systems 一个开源的c++包,用于开放量子系统的高性能最优控制
2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) Pub Date : 2021-10-19 DOI: 10.1109/QCS54837.2021.00014
Stefanie Günther, N. Petersson, J. Dubois
{"title":"Quandary: An open-source C++ package for high-performance optimal control of open quantum systems","authors":"Stefanie Günther, N. Petersson, J. Dubois","doi":"10.1109/QCS54837.2021.00014","DOIUrl":"https://doi.org/10.1109/QCS54837.2021.00014","url":null,"abstract":"Quantum optimal control can be used to shape the control pulses for realizing unitary and non-unitary transformations of quantum states. These control pulses provide the fundamental interface between the quantum compiler and the quantum hardware. Most current software for quantum optimal control (e.g. Qutip [1] or Krotov [2]) is restricted to run on shared memory platforms, limiting their applicability to smaller quantum systems, in particular if interactions with the environment are taken into account. This paper gives an overview of the open-source code Quandary, which is designed to solve quantum control problems in larger open quantum systems modelled by Lindblad’s master equation. Implemented in C++, Quandary uses the message passing paradigm for distributed memory computers that enables scalability to large numbers of compute cores. Accompanied by numerical examples, this paper presents an overview on existing theoretical developments for open optimal quantum control realizing state-to-state transfer, unitary gate optimization as well as state-preparation, and presents the numerical tools and implementation aspect as realized in Quandary, for deployment on modern high-performance computing platforms.","PeriodicalId":432600,"journal":{"name":"2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128593615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信